Higher-order simultaneous methods for the determination of polynomial multiple zeros

DOI10.1080/0020716031000148151zbMath1056.65050OpenAlexW2108735528MaRDI QIDQ4467338

Miodrag S. Petković, Lidija Z. Rančić, Ljiljana D. Petković

Publication date: 9 June 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000148151

zbMATH Keywords

convergencenumerical experimentspolynomialssolution setlinear interval equationsmultiple zerosLaguerre methodinterval boundinginterval solution

Mathematics Subject Classification ID

Related Items (2)

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 ⋮ 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. I: Correction methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some improvements of square root iteration for polynomial complex zeros
• A note on some improvements of the simultaneous methods for determination of polynomial zeros
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• A family of root finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• Some modifications of Laguerre's method
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

This page was built for publication: Higher-order simultaneous methods for the determination of polynomial multiple zeros