The numerical stability of the generalised root iterations for polynomial zeros

DOI10.1016/0898-1221(84)90041-5zbMATH Open0543.65022OpenAlexW2055064867MaRDI QIDQ796253FDOQ796253

Authors: M. S. Petković, Lidija V. Stefanović 

Publication date: 1984

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90041-5

Recommendations

• The numerical stability of a Laguerre-like method for the simultaneous inclusion of polynomial zeros
• The numerical stability of the improved Gargantini method
• On the convergence order of accelerated root iterations
• Generalized Ostrowski root-finding method
• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic

zbMATH Keywords

error boundsnumerical stabilityconvergence orderrounding errorspolynomial complex zerosgeneralised root iterations

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Cites Work

• Parallel Laguerre iterations: The complex case
• The numerical stability of simultaneous iterations via square-rooting
• Circular arithmetic and the determination of polynomial zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Title not available (Why is that?)
• On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
• Title not available (Why is that?)

Cited In (10)

• The numerical stability of a Laguerre-like method for the simultaneous inclusion of polynomial zeros
• Numerical stability of barycentric Hermite root-finding
• A hybrid method for polynomial complex zero
• Revisiting the stability of computing the roots of a quadratic polynomial
• On the efficiency of some combined methods for polynomial complex zeros
• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
• On the Location of Zeroes of Polynomials from the Stability Analysis of Novel Strong-Form Meshless Random Differential Quadrature Method
• A fast iterative method for determining the stability of a polynomial
• On an efficient inclusion method for finding polynomial zeros
• The numerical stability of the improved Gargantini method

This page was built for publication: The numerical stability of the generalised root iterations for polynomial zeros

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