A Modified Babylonian Algorithm
From MaRDI portal
The author proposes the following modification of the Babylonian algorithm for finding square roots. Let \(z_ 1 = 1\), \(a_ 1 = (x+1)/(x- 1)\), \(z_{k+1} = z_ k(1+1/a_ k)\) and \(a_{k+1} = 2a^ 2_ k-1\). Then \(a_ k\) is greater than 1 and the following hold: (a) \(z^ 2_ k = x(a_ k-1)/a_ k+1\); (b) \(z_ 1,z_ 2,\dots\) is an increasing sequence; (c) \(\lim_{k\to \infty} z_ k = \sqrt{x}\); (d) the convergence is quadratic; (e) the convergence is not uniform in \(x > 1\).
Recommendations
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)
