On two sequences of algorithms for approximating square roots
type: Item
instance of: scholarly article
title: On two sequences of algorithms for approximating square roots
zbMATH Open document ID: 0755.65022
DOI: 10.1016/0377-0427(92)90042-V
published in: Journal of Computational and Applied Mathematics
publication date: 1993-01-16T00:00:00Z
review text: 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\).
reviewed by: Luigi Gatteschi
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 40A15
Mathematics Subject Classification ID: 26A09
zbMATH DE Number: 89602
zbMATH Keywords: iterative methods
zbMATH Keywords: square root
zbMATH Keywords: continued fraction expansion
zbMATH Keywords: convergence
author: A. K. Yeyios
MaRDI profile type: Publication
cites work: Q3750018
cites work: Q5684132
cites work: An Iterative Method for Approximating Square Roots
cites work: Convergence of Continued Fractions
cites work: Q3880269
cites work: Q3857636
cites work: Q5732060
cites work: Q3339155
cites work: Q5678346
full work available at URL: 0377-0427(92)90042-v
OpenAlex ID: W2093009834
description: scientific article; zbMATH DE number 89602