On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
From MaRDI portal
Publication:5248100
DOI10.1080/00207160.2014.938063zbMath1408.65026OpenAlexW2079976377MaRDI QIDQ5248100
Miodrag S. Petković, Lidija Z. Rančić
Publication date: 27 April 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.938063
Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Numerical computation of roots of polynomial equations (65H04)
Related Items
Cites Work
- Unnamed Item
- A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations
- Point estimation of root finding methods
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Improvement of a convergence condition for Durand-Kerner iteration
- Weierstrass formula and zero-finding methods
- Point estimation and some applications to iterative methods
- On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
- The theory of Smale's point estimation and its applications
- On initial conditions for the convergence of simultaneous root finding methods
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- An acceleration of iterative processes for solving nonlinear equations
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Convergence of Newton’s method and inverse function theorem in Banach space
- On a cubically convergent derivative-free root finding method
This page was built for publication: On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
