On two sequences of algorithms for approximating square roots (Q1196844): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q595323 |
Changed an Item |
||
| Property / author | |||
| Property / author: A. K. Yeyios / rank | |||
Normal rank | |||
Revision as of 05:23, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two sequences of algorithms for approximating square roots |
scientific article |
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
