On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
From MaRDI portal
Publication:2008912
Recommendations
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- On new higher order families of simultaneous methods for finding polynomial zeros
- scientific article; zbMATH DE number 1823832
- On the convergence of a family of Weierstrass-type root-finding methods
- A new fourth-order family of simultaneous methods for finding polynomial zeros
Cites work
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- A generalization of the Banach contraction principle with high order of convergence of successive approximations
- A unified theory of cone metric spaces and its applications to the fixed point theory
- An extension of Gander's result for quadratic equations
- Convergence of the two-point Weierstrass root-finding method
- 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 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (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
- Newton-type iterative methods for finding zeros having higher multiplicity
- Numerical methods for roots of polynomials. II
- Numerical Methods in Scientific Computing, Volume I
- Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- On Halley's Iteration Method
- On optimal fourth-order iterative methods free from second derivative and their dynamics
- On some improvements of square root iteration for polynomial complex zeros
- On the convergence of a family of Weierstrass-type root-finding methods
- 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
- Point estimation and some applications to iterative methods
- Point estimation of root finding methods
- Relationships between different types of initial conditions for simultaneous root finding methods
- Scientific computing. An introduction using Maple and MATLAB
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
Cited in
(5)- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- Scaled parallel iterative method for finding real roots of nonlinear equations
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
- An iterative scheme to obtain multiple solutions simultaneously
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)
