On two sequences of algorithms for approximating square roots
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\).
scientific article; zbMATH DE number 89602