A Modified Babylonian Algorithm (Q4025324)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 123535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Modified Babylonian Algorithm |
scientific article; zbMATH DE number 123535 |
Statements
A Modified Babylonian Algorithm (English)
0 references
18 February 1993
0 references
square root algorithm
0 references
Babylonian algorithm
0 references
convergence
0 references
0.7590031623840332
0 references
0.7585148811340332
0 references
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\).
0 references
