A comparison of methods for terminating polynomial iterations

DOI10.1016/0377-0427(88)90272-5MaRDI QIDQ1113616zbMATH OpenOpenAlexFDO

Authors J. M. 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 methodspolynomial root-finding iterationsrounding errorstermination of an iterative methodzeros of polynomials

Mathematics Subject Classification ID

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

Review text

The author compares three different methods of terminating an iterative method for the approximate computation of a zero of a polynomial, one based on the explicit calculation of rounding errors, the second on differences of the iterates, and the third on different methods of calculating values of the polynomial. By means of extensive experiments with randomly generated polynomials it turns out that the simplest method - that based on differences of the iterates - usually gives the lowest actual error of the zero.

Recommendations

• On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
• scientific article; zbMATH DE number 953013
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• scientific article; zbMATH DE number 663833
• scientific article; zbMATH DE number 3928211
• scientific article; zbMATH DE number 57425
• Termination of polynomial loops
• scientific article; zbMATH DE number 1262456
• scientific article; zbMATH DE number 1263444
• scientific article; zbMATH DE number 4141790

Cites work

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

Cited in

(5)

• Determination of the zeros of a linear combination of generalised polynomials
• Termination of polynomial loops
• scientific article; zbMATH DE number 1263444 (Why is no real title available?)
• Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials)
• Numerical computation of polynomial zeros by means of Aberth's method

This page was built for publication: A comparison of methods for terminating polynomial iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113616)