On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

DOI10.1137/0711023zbMath0282.65038OpenAlexW2080960729MaRDI QIDQ4768562

Jürgen Herzberger, G. E. Alefeld

Publication date: 1974

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/335af7b937002679ba23b96c951894c1eba34c92

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)

Related Items (48)

On a class of higher order methods for simultaneous rootfinding of generalized polynomials ⋮ ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ Scaled parallel iterative method for finding real roots of nonlinear equations ⋮ On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane ⋮ On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ The Durand-Kerner polynomials roots-finding method in case of multiple roots ⋮ Simultaneous factorization of a polynomial by rational approximation ⋮ On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros ⋮ Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros ⋮ On some methods for the simultaneous determination of polynomial zeros ⋮ A family of simultaneous zero finding methods ⋮ Forward-backward serial iteration methods for simultaneously approximating polynomial zeros ⋮ The globalization of Durand-Kerner algorithm ⋮ Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen ⋮ On simultaneous factoring of a polynomial ⋮ 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 point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros ⋮ A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial ⋮ On the convergence order of a modified method for simultaneous finding polynomial zeros ⋮ On the generalization of the Alefeld-Herzberger's method ⋮ Higher-order iterative methods for approximating zeros of analytic functions ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Higher-order iteration functions for simultaneously approximating polynomial zeros ⋮ A class of simultaneous methods for the zeros of analytic functions ⋮ Chebyshev-like root-finding methods with accelerated convergence ⋮ The convergence of a class of parallel Newton-type iterative methods ⋮ A family of root-finding methods with accelerated convergence ⋮ On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros ⋮ An efficient higher order family of root finders ⋮ Weierstrass-like methods with corrections for the inclusion of polynomial zeros ⋮ Derivative free inclusion methods for polynomial zeros ⋮ Some methods for simultaneous extraction of a part of all multiple roots of algebraic polynomials ⋮ An algorithm for the total, or partial, factorization of a polynomial ⋮ On some improvements of square root iteration for polynomial complex zeros ⋮ Some modifications of Laguerre's method ⋮ Iteration functions re-visited ⋮ 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 ⋮ On the guaranteed convergence of new two-point root-finding methods for polynomial zeros ⋮ Complexity analysis of a process for simultaneously obtaining all zeros of polynomials ⋮ On some iteration functions for the simultaneous computation of multiple complex polynomial zeros ⋮ Higher-order simultaneous methods for the determination of polynomial multiple zeros ⋮ On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ On the \(Q\)-order of convergence for coupled sequences arising in iterative numerical processes ⋮ A note on some improvements of the simultaneous methods for determination of polynomial zeros ⋮ On the convergence order of accelerated root iterations ⋮ Two observations on Durand-Kerner's root-finding method ⋮ Some modifications of the parallel Halley iteration method and their convergence

This page was built for publication: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots