On two sequences of algorithms for approximating square roots (Q1196844): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3750018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5684132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Iterative Method for Approximating Square Roots / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of Continued Fractions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880269 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3857636 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732060 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3339155 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5678346 / rank | |||
Normal rank |
Revision as of 15:08, 16 May 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