Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
From MaRDI portal
Publication:343681
DOI10.1016/j.apnum.2016.10.013zbMath1354.65092OpenAlexW2542167254MaRDI QIDQ343681
Stoil I. Ivanov, Veselina K. Kyncheva, Viktor V. Yotov
Publication date: 28 November 2016
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2016.10.013
Newton's methodnumerical examplesHalley's methoda posteriori error estimateslocal convergencepolynomial zerosChebyshev's methodmultiple zeros
Related Items (8)
A general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functions ⋮ On a two-step optimal Steffensen-type method: relaxed local and semi-local convergence analysis and dynamical stability ⋮ 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 ⋮ PSEM approximations for both branches of Lambert \(W\) function with applications ⋮ Local convergence analysis for Chebyshev's method ⋮ The W4 method: a new multi-dimensional root-finding scheme for nonlinear systems of equations ⋮ Study of semilocal convergence analysis of Chebyshev's method under new type majorant conditions
Cites Work
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- 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
- 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
- Parallel square-root iterations for multiple roots
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Simultaneous point estimates for Newton's method
- A unified theory of cone metric spaces and its applications to the fixed point theory
- On the convergence of Halley's method for multiple polynomial zeros
- On the convergence of Chebyshev's method for multiple polynomial zeros
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations
- An algorithm for the total, or partial, factorization of a polynomial
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- On the Geometry of Halley's Method
- Historical Development of the Newton–Raphson Method
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
