Root Finding Algorithms

Root Finding Algorithms is a computational method belonging to the class of numerical analysis techniques, distinguished by its purpose of determining the zeros of a function, i.e., the values of the variable for which the function evaluates to zero.

891

Publications

37K

Citations

1.3K

Authors

630

Institutions

Publications per year

2017–2026

132

Variants

Root Finding MethodsRoot-finding AlgorithmsRoot-finding Methods

Authors

1.3K

  1. BN
    Beny Neta

    Naval Postgraduate School, United States

    22 publications · 1.1K citations

    18

    h-index

  2. VY
    Victor Y. Pan

    Lehman College, United States

    18 publications · 803 citations

    16

    h-index

  3. MS
    Miodrag S. Petković

    University of Nis, Serbia

    20 publications · 580 citations

    15

    h-index

  4. CC
    Changbum Chun

    Sungkyunkwan University, South Korea

    13 publications · 664 citations

    13

    h-index

  5. MS
    Michael Sagraloff

    Max Planck Institute for Informatics, Germany

    13 publications · 408 citations

    12

    h-index

1–5 of 1.3K

Venues

  1. Applied Mathematics and Computation

    45 publications · 1.8K citations

    23

    h-index

  2. Journal of Computational and Applied Mathematics

    38 publications · 1.4K citations

    22

    h-index

  3. Mathematics of Computation

    MCOM · 32 publications · 2.7K citations

    20

    h-index

  4. IEEE Transactions on Automatic Control

    19 publications · 890 citations

    15

    h-index

  5. Computers & Mathematics with Applications

    22 publications · 823 citations

    15

    h-index

1–5