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
Parents
821
Elementary Numerical Analysis.
W. G., Kendall Atkinson · Mathematics of Computation · 1994 · 1.3K citations
1–5 of 821
1.1K
16
h-index
15
h-index
15
h-index
12
h-index
11
h-index
1–5 of 1.1K
582
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
18 h-index
34 publications
1.4K citations
University of Nis
Niš, Serbia
15 h-index
38 publications
824 citations

Naval Postgraduate School
Monterey, United States
15 h-index
20 publications
940 citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
28 publications
1.4K citations

Chinese Academy of Sciences
Beijing, China
12 h-index
22 publications
816 citations
Lehman College
New York, United States
12 h-index
15 publications
542 citations
Sungkyunkwan University
Seoul, South Korea
11 h-index
12 publications
595 citations
Universitat Politècnica de València
Valencia, Spain
11 h-index
27 publications
780 citations
1–8 of 582
43 publications · 1.8K citations
22
h-index
31 publications · 1.2K citations
21
h-index
MCOM · 37 publications · 3.2K citations
20
h-index
22 publications · 691 citations
16
h-index
22 publications · 1K citations
16
h-index
1–5