A stopping criterion for polynomial root finding

DOI10.1145/363717.363775MaRDI QIDQ5557402zbMATH OpenOpenAlexFDO

Authors D. A. Adams

Publication date 1967

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363717.363775

zbMATH Keywords

numerical analysis

Cited in

(8)

• Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
• Practical problems arising for finding roots of nonlinear equations
• A comparison of methods for terminating polynomial iterations
• On Newton's method with a class of rational functions
• Determination of the zeros of a linear combination of generalised polynomials
• Rounding error analysis of Horner's scheme
• A root-finding algorithm based on Newton's method
• Numerical computation of polynomial zeros by means of Aberth's method

This page was built for publication: A stopping criterion for polynomial root finding

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