An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros

DOI10.1016/0377-0427(94)00114-6zbMath0860.65040OpenAlexW2027719356MaRDI QIDQ1917920

J. A. Stolan

Publication date: 21 April 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00114-6

zbMATH Keywords

quadratic convergencepolynomial equationsmultiple rootsŠiljak's algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)

Related Items

Computing multiple roots of inexact polynomials

Cites Work

• A family of root finding methods
• Stability theory by Liapunov's direct method
• A bibliography on roots of polynomials
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• The Laguerre method for finding the zeros of polynomials
• Principles for Testing Polynomial Zerofinding Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item