The numerical stability of the generalised root iterations for polynomial zeros

DOI10.1016/0898-1221(84)90041-5zbMath0543.65022OpenAlexW2055064867MaRDI QIDQ796253

Miodrag 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

zbMATH Keywords

error boundsnumerical stabilitypolynomial complex zerosrounding errorsconvergence ordergeneralised 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)

Related Items

On the efficiency of some combined methods for polynomial complex zeros, On an efficient inclusion method for finding polynomial zeros, A hybrid method for polynomial complex zero

Cites Work

• On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
• 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
• Unnamed Item
• Unnamed Item