On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Numerical Methods in Scientific Computing, Volume I
A unified theory of cone metric spaces and its applications to the fixed point theory
A generalization of the Banach contraction principle with high order of convergence of successive approximations
On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
Relationships between different types of initial conditions for simultaneous root finding methods
Point estimation of root finding methods
General local convergence theory for a class of iterative processes and its applications to Newton's method
On optimal fourth-order iterative methods free from second derivative and their dynamics
Numerical methods for roots of polynomials. II
General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
Convergence of the two-point Weierstrass root-finding method
On a family of Weierstrass-type root-finding methods with accelerated convergence
On the convergence of Halley's method for simultaneous computation of polynomial zeros
On Halley's Iteration Method
An extension of Gander's result for quadratic equations
On some improvements of square root iteration for polynomial complex zeros
Point estimation and some applications to iterative methods
Scientific Computing - An Introduction using Maple and MATLAB
Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method
A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
Newton-type iterative methods for finding zeros having higher multiplicity

Cited In (4)

Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
An iterative scheme to obtain multiple solutions simultaneously
A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
Scaled parallel iterative method for finding real roots of nonlinear equations

Uses Software

Mulprec

This page was built for publication: On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros

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