The convergence of a family of parallel zero-finding methods
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)
The aim of the paper is to introduce computationally verifiable initial conditions which could guarantee the convergence of the recently introduced class of fourth-order methods [cf. \textit{T. Sakurai} and \textit{M. S. Petković}, J. Comput. Appl. Math. 72, 275--291 (1996; Zbl 0859.65048)] for simultaneous finding polynomial zeros. First, the authors introduce some basic facts on circular complex arithmetic. Then they prove several technical lemmas. Finally, they state two significant theorems concerning the initial conditions for the convergence. These conditions depend only on polynomial coefficients, its degree and initial approximations of zeros, thus they can be easily verified.
- On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
- Point estimation of a family of simultaneous zero-finding methods
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- On the guaranteed convergence of the Japanese zero-finding method
- A new fourth-order family of simultaneous methods for finding polynomial zeros
- A family of root finding methods
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A modified Newton method for polynomials
- Approximate Zeros of Quadratically Convergent Algorithms
- Convergence of Newton’s method and inverse function theorem in Banach space
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3780477 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 930560 (Why is no real title available?)
- Improvement of a convergence condition for Durand-Kerner iteration
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- On some simultaneous methods based on Weierstrass' correction
- On zero finding methods of higher order from data at one point
- Parallel Laguerre iterations: The complex case
- Point estimation of a family of simultaneous zero-finding methods
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- The fundamental theorem of algebra and complexity theory
- The theory of Smale's point estimation and its applications
- Weierstrass formula and zero-finding methods
- Point estimation of a family of simultaneous zero-finding methods
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- On initial conditions for the convergence of simultaneous root finding methods
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- An efficient higher order family of root finders
- On the guaranteed convergence of the Japanese zero-finding method
- On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
This page was built for publication: The convergence of a family of parallel zero-finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767950)
