Safe convergence of simultaneous methods for polynomial zeros

DOI10.1023/A:1016688508558MaRDI QIDQ1264390zbMATH OpenOpenAlexFDO

Authors M. S. Petković, Snežana Ilić, Djordje Herceg

Publication date 26 January 1999

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016688508558

zbMATH Keywords

iterative methodsnumerical examplesorder of convergencepoint estimationsafe initial valuessimultaneous methodszeros of polynomials

Mathematics Subject Classification ID

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

Review text

The authors present the point estimation theory for simultaneous iterative methods applied to polynomials with simple zeros. A convergence theorem is proved to serve as a basis for the safe convergence of the iterative methods discussed. Examples illustrate the theory and initial conditions (the polynomial coefficients, the order of the polynomial and the initial approximations for the zeros) enabling a safe convergence are stated.

Recommendations

• Point estimation and some applications to iterative methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.

Cited in

(20)

• On the convergence of Wang-Zheng's method
• Point estimation and some applications to iterative methods
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
• Improved algorithms for computing determinants and resultants
• Point estimation of a family of simultaneous zero-finding methods
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
• An efficient higher order family of root finders
• Chebyshev-like root-finding methods with accelerated convergence
• scientific article; zbMATH DE number 1512150 (Why is no real title available?)
• scientific article; zbMATH DE number 1868929 (Why is no real title available?)
• On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
• On a cubically convergent derivative-free root finding method
• On the new fourth-order methods for the simultaneous approximation of polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
• Point estimation of root finding methods

This page was built for publication: Safe convergence of simultaneous methods for polynomial zeros

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264390)