On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method

DOI10.1080/00207160.2014.938063MaRDI QIDQ5248100zbMATH OpenOpenAlexFDO

Authors M. 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

zbMATH Keywords

guaranteed convergenceinitial conditionsiterative methodspolynomial rootssimultaneous methods

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 6451405
• On the guaranteed convergence of the square-root iteration method
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• The guaranteed convergence of Laguerre-like method
• scientific article; zbMATH DE number 6172789

Cites work

• A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations
• An acceleration of iterative processes for solving nonlinear equations
• Convergence of Newton’s method and inverse function theorem in Banach space
• General local convergence theory for a class of iterative processes and its applications to Newton's method
• scientific article; zbMATH DE number 1194122 (Why is no real title available?)
• Improvement of a convergence condition for Durand-Kerner iteration
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• On a cubically convergent derivative-free root finding method
• On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
• On initial conditions for the convergence of simultaneous root finding methods
• Point estimation and some applications to iterative methods
• Point estimation of root finding methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• The theory of Smale's point estimation and its applications
• Weierstrass formula and zero-finding methods

Cited in

(7)

• A fast and robust method for computing real roots of nonlinear equations
• scientific article; zbMATH DE number 6451405 (Why is no real title available?)
• On a cubically convergent derivative-free root finding method
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• On the convergence of the third order root-solver
• The guaranteed convergence of Laguerre-like method
• On a family of Weierstrass-type root-finding methods with accelerated convergence

This page was built for publication: On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method

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