An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
type: Item
instance of: scholarly article
title: An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
zbMATH Open document ID: 0860.65040
DOI: 10.1016/0377-0427(94)00114-6
author: J. A. Stolan
published in: Journal of Computational and Applied Mathematics
publication date: 1997-04-21T00:00:00Z
review text: The author proposes an improved quadratically convergent version of Šiljak's algorithm for solving polynomial equations with multiple roots. It is shown how to extract the information about the multiplicity of polynomial zeros during the iteration process.
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 903552
zbMATH Keywords: quadratic convergence
zbMATH Keywords: Šiljak's algorithm
zbMATH Keywords: polynomial equations
zbMATH Keywords: multiple roots
MaRDI profile type: Publication
full work available at URL: 0377-0427(94)00114-6
OpenAlex ID: W2027719356
cites work: A family of root finding methods
cites work: Q4067388
cites work: Q3748118
cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
cites work: Principles for Testing Polynomial Zerofinding Programs
cites work: A bibliography on roots of polynomials
cites work: The Laguerre method for finding the zeros of polynomials
cites work: Q4438142
cites work: Q3713481
cites work: Q4195836
cites work: Stability theory by Liapunov's direct method
cites work: Q5590219
description: scientific article; zbMATH DE number 903552