A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously

Iteration methods for finding all zeros of a polynomial simultaneously

Oliver Aberth · Mathematics of Computation · 1973 · 315 citations

Computing, Computer Science, Algorithms +10

New general convergence theory for iterative processes and its applications to Newton–Kantorovich type theorems

Petko D. Proĭnov · Journal of Complexity · 2009 · 222 citations

Computing, Computer Science, Scientific Computing +12

A modified Newton method for polynomials

Louis W. Ehrlich · Communications of the ACM · 1967 · 220 citations · Full text

Natural Sciences, Mathematics, Algorithms +6

General local convergence theory for a class of iterative processes and its applications to Newton’s method

Petko D. Proĭnov · Journal of Complexity · 2008 · 125 citations

Computing, Computer Science, Scientific Computing +12

Weierstrass formula and zero-finding methods

Miodrag S. Petković, Carsten Carstensen, Miroslav Trajkov'i c · Numerische Mathematik · 1995 · 65 citations

Natural Sciences, Mathematics, Differential Equations +3