An Iterative Method for Approximating Square Roots

DOI10.2307/2689764MaRDI QIDQ4207966zbMATH OpenOpenAlexFDO

Authors Kenneth R. Johnson

Publication date 1989

Full work available at URL https://doi.org/10.2307/2689764

zbMATH Keywords

continued fraction approximationsPell's equationsquare roots

Mathematics Subject Classification ID

History of Babylonian mathematics (01A17) Continued fractions (11A55) Linear Diophantine equations (11D04)

Recommendations

• On two sequences of algorithms for approximating square roots
• scientific article; zbMATH DE number 1398650
• Continued fractions and linear fractional transformations
• New methods for approximating square roots
• scientific article; zbMATH DE number 410201

Cited in

(9)

• On two sequences of algorithms for approximating square roots
• Newton's method and high-order algorithms for the \(n\)th root computation
• Algorithms for \(n\)-th root approximation.
• A tight bound for approximating the square root
• Inverse function, Taylor's expansion and extended Schröder's processes
• scientific article; zbMATH DE number 16413 (Why is no real title available?)
• The Iterated Total Squaring Operation
• Digging for roots using the Pascal spade
• Square rooting by iterative multiply-additions

This page was built for publication: An Iterative Method for Approximating Square Roots

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