Skip Navigation

The Computer Journal 1989 32(1):93-94; doi:10.1093/comjnl/32.1.93
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jamieson, M. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies

M. J. Jamieson *

Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, USA

A derivation is given of rapidly converging iterative formulae for finding square roots which include, as special cases, some recently published examples. Their computational efficiencies are investigated for sequential and parallel implementation. It is concluded that the most efficient method is equivalent to sequential application of the Newton Raphson formula; a simple modification is suggested which brings the advantage of root bracketing at little extra computational cost.


* Department of Computing Science, University of Glasgow, Glasgow G12 8QQ.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.