A stopping criterion for polynomial root finding
From MaRDI portal
Publication:5557402
DOI10.1145/363717.363775zbMath0171.13302OpenAlexW2087142069MaRDI QIDQ5557402
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
Related Items
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, A root-finding algorithm based on Newton's method, Numerical computation of polynomial zeros by means of Aberth's method, Determination of the zeros of a linear combination of generalised polynomials, Rounding error analysis of Horner's scheme
