A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials

DOI10.2307/2007566zbMath0529.65022OpenAlexW4248122580MaRDI QIDQ3311582

Masao Igarashi

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/2007566

zbMATH Keywords

zeros of polynomialsfloating-point arithmetictermination criterionNewton-Raphson's method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

On an new open type variant of Newton's method ⋮ Practical problems arising for finding roots of nonlinear equations ⋮ Relationships between order and efficiency of a class of methods for multiple zeros of polynomials ⋮ A comparison of methods for terminating polynomial iterations ⋮ Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation ⋮ Variant of Newton's method using Simpson's 3/8th rule ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Geometric mean Newton's method for simple and multiple roots ⋮ Some new variants of Newton's method. ⋮ A derivative free globally convergent method and its deformations ⋮ Practical stopping rule for finding roots of nonlinear equations