On two sequences of algorithms for approximating square roots

DOI10.1016/0377-0427(92)90042-VzbMath0755.65022OpenAlexW2093009834MaRDI QIDQ1196844

A. K. Yeyios

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-0427(92)90042-v

zbMATH Keywords

convergenceiterative methodscontinued fraction expansionsquare root

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Convergence and divergence of continued fractions (40A15) Elementary functions (26A09)

Related Items (7)

A basic family of iteration functions for polynomial root finding and its characterizations ⋮ Inverse function, Taylor's expansion and extended Schröder's processes ⋮ optimum modified extrapolated jacobi method for some class of matrices ⋮ Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications ⋮ Newton's method and high-order algorithms for the \(n\)th root computation ⋮ Algorithms for \(n\)-th root approximation. ⋮ \(n\)th root extraction: Double iteration process and Newton's method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Iterative Method for Approximating Square Roots
• Convergence of Continued Fractions

This page was built for publication: On two sequences of algorithms for approximating square roots