Convergence of the two-point Weierstrass root-finding method
From MaRDI portal
Let \((\mathbb{K},|\cdot|)\) denotes an arbitrary normed field and \(\mathbb{K}[z]\) denotes the ring of polynomials (in one variable) over \(\mathbb{K}\). Let \(f \in \mathbb{K}[z]\) be a polynomial of degree \(n \geq 2\) which has \(n\) simple zeros in \(\mathbb{K}\). A new local and semilocal convergence theorems for two--point Weierstrass method for the simultaneous computation of polynomial zeros given in the article. Three numerical examples presented.
Recommendations
- Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- New local convergence theorems for the inverse Weierstrass method for simultaneous approximation of polynomial zeros
Cites work
- A biparametric family of inverse-free multipoint iterations
- Certain modifications of Newton's method for the approximate solution of algebraic equations
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- On some families of multi-point iterative methods for solving nonlinear equations
- On some methods for the simultaneous determination of polynomial zeros
- On the convergence of multipoint iterations
- On the determination of the safe initial approximation for the Durand- Kerner algorithm
- Point estimation of root finding methods
- Relationships between different types of initial conditions for simultaneous root finding methods
- The simultaneous approximation of polynomial roots
- Two-point iterative methods for solving nonlinear equations
- Unified majorizing sequences for Traub-type multipoint iterative procedures
- Zero-finder methods derived from Obreshkov's techniques
Cited in
(15)- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
- scientific article; zbMATH DE number 621974 (Why is no real title available?)
- On the divergent properties of two-sided SOR Weierstrass method
- scientific article; zbMATH DE number 6451405 (Why is no real title available?)
- Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
- Relationships between different types of initial conditions for simultaneous root finding methods
This page was built for publication: Convergence of the two-point Weierstrass root-finding method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403839)
