On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
From MaRDI portal
Publication:2008912
DOI10.1016/j.amc.2018.12.041zbMath1429.65100OpenAlexW2912940379WikidataQ128468122 ScholiaQ128468122MaRDI QIDQ2008912
Stoil I. Ivanov, Petko D. Proinov, Miodrag S. Petković
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.041
error estimatessemilocal convergencelocal convergencepolynomial zerositeration methodssimultaneous methods
Related Items (4)
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 ⋮ Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros ⋮ An iterative scheme to obtain multiple solutions simultaneously
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- Convergence of the two-point Weierstrass root-finding 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 a family of Weierstrass-type root-finding methods with accelerated convergence
- On the convergence of Halley's method for simultaneous computation of polynomial zeros
- Relationships between different types of initial conditions for simultaneous root finding methods
- Point estimation of root finding methods
- An extension of Gander's result for quadratic equations
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Point estimation and some applications to iterative methods
- 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
- Numerical methods for roots of polynomials. II
- A unified theory of cone metric spaces and its applications to the fixed point theory
- 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
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Numerical Methods in Scientific Computing, Volume I
- On Halley's Iteration Method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Newton-type iterative methods for finding zeros having higher multiplicity
- Scientific Computing - An Introduction using Maple and MATLAB
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
This page was built for publication: On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
