Methods with prefixed order for approximating square roots with global and general convergence

DOI10.1016/J.AMC.2007.04.033zbMath1193.65062OpenAlexW2075909279MaRDI QIDQ990680

J. Martínez

Publication date: 1 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.033

zbMATH Keywords

global convergenceiterative processessquare rootgeneral convergence

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Iteration of real functions in one variable (26A18)

Related Items (1)

Catalan generating functions for bounded operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphic and numerical comparison between iterative methods
• Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
• Families of rational maps and iterative root-finding algorithms
• Indices of convexity and concavity. Application to Halley method
• Globally convergent algorithm for solving nonlinear equations
• Accelerated convergence in Newton's method for approximating square roots
• New methods for approximating square roots
• Algorithms for \(n\)-th root approximation.
• On Halley's Iteration Method
• On the efficiency of algorithms of analysis
• The components of a Julia set
• Classroom Note:Geometry and Convergence of Euler's and Halley's Methods

This page was built for publication: Methods with prefixed order for approximating square roots with global and general convergence