A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously

Recommendations

On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
On the new fourth-order methods for the simultaneous approximation of polynomial zeros
On the fourth order zero-finding methods for polynomials
Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros

Cites work

A family of simultaneous zero-finding methods
A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
A new semilocal convergence theorem for the Weierstrass method from data at one point
A unified theory of cone metric spaces and its applications to the fixed point theory
Convergence of Chebyshev-like method for simultaneous approximation of multiple polynomial zeros
Convergence of the two-point Weierstrass root-finding method
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
General local convergence theory for a class of iterative processes and its applications to Newton's method
scientific article; zbMATH DE number 6395662 (Why is no real title available?)
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
On some simultaneous methods based on Weierstrass' correction
On the convergence of Halley's method for simultaneous computation of polynomial zeros
On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
On the new fourth-order methods for the simultaneous approximation of polynomial zeros
Relationships between different types of initial conditions for simultaneous root finding methods
Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros

Cited in

(6)

Unified convergence analysis for Picard iteration in n-dimensional vector spaces
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
Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
On hybrid parallel scheme for biomedical engineering problems

This page was built for publication: A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously

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