Properly rounded variable precision square root

Authors:
T. E. Hull;A. Abrham
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4, Canada;Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4, Canada
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1985

Citing 5
Cited 3

Introduction to computer science using the TURING programming language

Introduction to computer science using the TURING programming language
Functions for manipulating floating-point numbers

ACM SIGNUM Newsletter
Functions for manipulating floating-point numbers

ACM SIGNUM Newsletter
Numerical Turing

ACM SIGNUM Newsletter
Software Manual for the Elementary Functions (Prentice-Hall series in computational mathematics)

Software Manual for the Elementary Functions (Prentice-Hall series in computational mathematics)

Variable precision exponential function

ACM Transactions on Mathematical Software (TOMS)
New scalar and vector elementary functions for the IBM system/370

IBM Journal of Research and Development
Numerical Turing

ACM SIGNUM Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

The square root function presented here returns a properly rounded approximation to the square root of its argument, or it raises an error condition if the argument is negative. Properly rounded means rounded to the nearest, or to nearest even in case of a tie. It is variable precision in that it is designed to return a p-digit approximation to a p-digit argument, for any p 0. (Precision p means p decimal digits.) The program and the analysis are valid for all p 0, but current implementations place some restrictions on p.