Polynomial Root Finding

Polynomial Root Finding is a computational method in numerical analysis for determining the roots of a polynomial function by identifying the values of the variable at which the polynomial evaluates to zero.

821

Publications

31.7K

Citations

1.1K

Authors

582

Institutions

Publications per year

2017–2026

96

Authors

1.1K

  1. BN
    Beny Neta

    Naval Postgraduate School, United States

    19 publications · 990 citations

    16

    h-index

  2. MS
    Miodrag S. Petković

    University of Nis, Serbia

    20 publications · 493 citations

    15

    h-index

  3. VY
    Victor Y. Pan

    Lehman College, United States

    17 publications · 626 citations

    15

    h-index

  4. CC
    Changbum Chun

    Sungkyunkwan University, South Korea

    12 publications · 633 citations

    12

    h-index

  5. MS
    Michael Sagraloff

    Max Planck Institute for Informatics, Germany

    12 publications · 323 citations

    11

    h-index

1–5 of 1.1K

Venues

  1. Applied Mathematics and Computation

    43 publications · 1.8K citations

    22

    h-index

  2. Journal of Computational and Applied Mathematics

    31 publications · 1.2K citations

    21

    h-index

  3. Mathematics of Computation

    MCOM · 37 publications · 3.2K citations

    20

    h-index

  4. Computers & Mathematics with Applications

    22 publications · 691 citations

    16

    h-index

  5. Journal of Symbolic Computation

    22 publications · 1K citations

    16

    h-index

1–5