|
ABSTRACT
We present division and square root algorithm for calculations with more bits than are handled by the floating-point hardware. These algorithms avoid the need to multiply two high-precision numbers, speeding up the last iteration by as much as a factor of 10. We also show how to produce the floating-point number closest to the exact result with relatively few additional operations.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Ramesh C Agarwal , James W Cooley , Fred G Gustavson , James B Shearer , Gordon Slishman , Bryant Tuckerman, New scalar and vector elementary functions for the IBM system/370, IBM Journal of Research and Development, v.30 n.2, p.123-144, March 1986
|
| |
2
|
ANSI. 1985. ANSI/IEEE standard for binary floating point arithmetic. Tech. Rep. ANSI/ IEEE Standard 754-1985. IEEE Press, Piscataway, NJ.
|
| |
3
|
BAILEY, D.H. 1992. A portable high performance multiprecision package. RNR Tech. Rep. RNR-90-022. NASA Ames Research Center, Moffett Field, CA.
|
| |
4
|
GOLDBERG, D. 1990. Appendix A. In Computer Architecture'A Qualitative Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA.
|
| |
5
|
HEWLETT-PACKARD. 1991. HP-UX Reference. 1st ed. Hewlett-Packard, Fort Collins, CO.
|
| |
6
|
|
| |
7
|
KAHAN, W. 1987. Checking whether floating-point division is correctly rounded. Monograph. Computer Science Dept., University of California at Berkeley, Berkeley, CA.
|
| |
8
|
|
| |
9
|
MONUSCHI, P. AND MEZZALAMA, M. 1990. Survey of square rooting algorithms. IEE Proc. 137, 1, Part E (Jan.), 31-40.
|
| |
10
|
OLSSON, B., MONTOYE, R., MARKSTEIN, P., AND NGYUENPHU, M. 1990. RISC System~6000 Floating-Point Unit. IBM Corp., Riverton, NJ.
|
| |
11
|
|
REVIEW
"James Martin Varah : Reviewer"
The authors examine the usual (Newton-Raphson) algorithms for
division and for extraction of square roots. These operations are
significantly more time-consuming than addition and multiplication,
particularly when high precision is
more...
|