On the guaranteed convergence of the square-root iteration method

DOI10.1016/J.CAM.2003.12.040MaRDI QIDQ596189zbMATH OpenOpenAlexFDO

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

convergenceinitial conditionsimple zerospoint estimationzeros of polynomialsOstrowski-like iterationsquare-root method

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 786563
• scientific article; zbMATH DE number 5296548
• Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros
• On some improvements of square root iteration for polynomial complex zeros
• scientific article; zbMATH DE number 6172789

Cites work

• scientific article; zbMATH DE number 3780477 (Why is no real title available?)
• scientific article; zbMATH DE number 27984 (Why is no real title available?)
• scientific article; zbMATH DE number 1313043 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• scientific article; zbMATH DE number 3318229 (Why is no real title available?)
• Approximate Zeros of Quadratically Convergent Algorithms
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• On zero finding methods of higher order from data at one point
• Point estimation and some applications to iterative methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
• The theory of Smale's point estimation and its applications
• Weierstrass formula and zero-finding methods

Cited in

(9)

• Overshooting properties of Newton-like and Ostrowski-like methods
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• The guaranteed convergence of Laguerre-like method
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• scientific article; zbMATH DE number 5296548 (Why is no real title available?)
• On exponential convergence of nonlinear gradient dynamics system with application to square root finding
• scientific article; zbMATH DE number 1868868 (Why is no real title available?)
• On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method

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

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