A comparison of methods for terminating polynomial iterations
From MaRDI portal
Publication:1113616
DOI10.1016/0377-0427(88)90272-5zbMATH Open0661.65049OpenAlexW2037292553MaRDI QIDQ1113616FDOQ1113616
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
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
comparison of methodszeros of polynomialsrounding errorspolynomial root-finding iterationstermination of an iterative method
Cites Work
- 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
- A stopping criterion for polynomial root finding
- The accuracy of floating point computers
Cited In (4)
- Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials)
- Termination of polynomial loops
- Numerical computation of polynomial zeros by means of Aberth's method
- Determination of the zeros of a linear combination of generalised polynomials
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)
