On the guaranteed convergence of the square-root iteration method

DOI10.1016/j.cam.2003.12.040zbMath1054.65048OpenAlexW2014908629MaRDI QIDQ596189

Miodrag S. Petković, Lidija Z. Rančić

Publication date: 10 August 2004

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2003.12.040

zbMATH Keywords

convergencezeros of polynomialspoint estimationinitial conditionsimple zerosOstrowski-like iterationsquare-root method

Mathematics Subject Classification ID

Related Items (1)

Point estimation of simultaneous methods for solving polynomial equations: A survey. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On zero finding methods of higher order from data at one point
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
• Weierstrass formula and zero-finding methods
• Point estimation and some applications to iterative methods
• The theory of Smale's point estimation and its applications
• On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• Approximate Zeros of Quadratically Convergent Algorithms
• Point estimation of simultaneous methods for solving polynomial equations: A survey

This page was built for publication: On the guaranteed convergence of the square-root iteration method