A comparison of methods for terminating polynomial iterations

DOI10.1016/0377-0427(88)90272-5zbMath0661.65049OpenAlexW2037292553MaRDI QIDQ1113616

John Michael McNamee

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90272-5

zbMATH Keywords

comparison of methodszeros of polynomialsrounding errorspolynomial root-finding iterationstermination of an iterative method

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05)

Related Items

Numerical computation of polynomial zeros by means of Aberth's method ⋮ Determination of the zeros of a linear combination of generalised polynomials

Cites Work

• A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
• A stopping criterion for polynomial root finding
• The accuracy of floating point computers
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Practical Problems Arising in the Solution of Polynomial Equations