On two sequences of algorithms for approximating square roots (Q1196844): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-0427(92)90042-v / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093009834 / rank | |||
Normal rank | |||
Latest revision as of 11:03, 30 July 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
