A Modified Babylonian Algorithm

DOI10.2307/2324239MaRDI QIDQ4025324zbMATH OpenOpenAlexFDO

Authors Ronald J. Knill

Publication date 18 February 1993

Published in The American Mathematical Monthly (Search for Journal in Brave)

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

zbMATH Keywords

Babylonian algorithmconvergencesquare root algorithm

Mathematics Subject Classification ID

Elementary functions (26A09) Computation of special functions and constants, construction of tables (65D20)

Recommendations

• Publication:4490828
• On two sequences of algorithms for approximating square roots
• Accelerated convergence in Newton's method for approximating square roots
• scientific article; zbMATH DE number 3961549
• scientific article; zbMATH DE number 3886504

Cited in

(10)

• nth root extraction: Double iteration process and Newton's method
• New methods for approximating square roots
• On a characterization of some Newton-like methods of R-order at least three
• Newton's method and high-order algorithms for the \(n\)th root computation
• How the estimate of \(\sqrt{2}\) on YBC 7289 may have been calculated
• Inverse function, Taylor's expansion and extended Schröder's processes
• scientific article; zbMATH DE number 1479873 (Why is no real title available?)
• High order algorithms for approximatingnth roots
• scientific article; zbMATH DE number 6151737 (Why is no real title available?)
• A note on machine method for root extraction

This page was built for publication: A Modified Babylonian Algorithm

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