On two sequences of algorithms for approximating square roots (Q1196844)
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 89602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On two sequences of algorithms for approximating square roots |
scientific article; zbMATH DE number 89602 |
Statements
On two sequences of algorithms for approximating square roots (English)
0 references
16 January 1993
0 references
Two sequences of iterative methods for approximating the square root \(\sqrt{N}\) are derived by using a continued fraction expansion. The convergence of the algorithms is proved. It is also shown that algorithms of arbitrary order can be constructed for the approximation of \(\sqrt N\).
0 references
iterative methods
0 references
square root
0 references
continued fraction expansion
0 references
convergence
0 references
0.8222466707229614
0 references
0.8073927164077759
0 references
0.8047606348991394
0 references
0.8032701015472412
0 references
