An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
From MaRDI portal
Publication:1917920
DOI10.1016/0377-0427(94)00114-6zbMath0860.65040MaRDI QIDQ1917920
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
65H10: Numerical computation of solutions to systems of equations
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
26C10: Real polynomials: location of zeros
Related Items
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