Root Finding

Root Finding is a numerical method within computational mathematics that identifies the values of a variable for which a given function evaluates to zero, distinguishing itself from other solution techniques by specifically seeking inputs that nullify the function's output.

1.1K

Publications

59.1K

Citations

1.6K

Authors

778

Institutions

Publications per year

2017–2026

127

Authors

1.6K

  1. BN
    Beny Neta

    Naval Postgraduate School, United States

    15 publications · 784 citations

    14

    h-index

  2. MS
    Miodrag S. Petković

    University of Nis, Serbia

    15 publications · 476 citations

    13

    h-index

  3. VY
    Victor Y. Pan

    Lehman College, United States

    15 publications · 672 citations

    13

    h-index

  4. MS
    Michael Sagraloff

    Max Planck Institute for Informatics, Germany

    14 publications · 425 citations

    12

    h-index

  5. JR
    Juan R. Torregrosa

    Universitat Politècnica de València, Spain

    10 publications · 233 citations

    10

    h-index

1–5 of 1.6K

Venues

  1. Journal of Computational and Applied Mathematics

    39 publications · 1.6K citations

    24

    h-index

  2. Mathematics of Computation

    MCOM · 40 publications · 6.2K citations

    22

    h-index

  3. Applied Mathematics and Computation

    36 publications · 1.5K citations

    20

    h-index

  4. Computers & Mathematics with Applications

    20 publications · 665 citations

    15

    h-index

  5. IEEE Transactions on Automatic Control

    25 publications · 3.2K citations

    15

    h-index

1–5