A Modified Babylonian Algorithm

DOI10.2307/2324239zbMath0781.65014OpenAlexW4249717622MaRDI QIDQ4025324

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

convergencesquare root algorithmBabylonian algorithm

Mathematics Subject Classification ID

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

Related Items (7)

New methods for approximating square roots ⋮ Inverse function, Taylor's expansion and extended Schröder's processes ⋮ High order algorithms for approximatingnth roots ⋮ A note on machine method for root extraction ⋮ 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 ⋮ \(n\)th root extraction: Double iteration process and Newton's method

This page was built for publication: A Modified Babylonian Algorithm