The numerical stability of simultaneous iterations via square-rooting

DOI10.1016/0898-1221(81)90136-XzbMath0402.65030MaRDI QIDQ1255766

Irene Gargantini

Publication date: 1979

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

zbMATH Keywords

Circular ArithmeticConvergence of the Successive IteratesNumerical StabilityRoots of a PolynomialSquare-Root Iteration

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

Improved methods for the simultaneous inclusion of multiple polynomial zeros, Parallel square-root iterations for multiple roots, 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 an efficient inclusion method for finding polynomial zeros, Generalized Ostrowski root-finding method, A hybrid method for polynomial complex zero, On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros, On a family of parallel root-finding methods for generalized polynomials, The numerical stability of the generalised root iterations for polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel Laguerre iterations: The complex case
• Comparing parallel Newton's method with parallel Laguerre's method
• Circular arithmetic and the determination of polynomial zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials