ABSTRACT
FM is a collection of FORTRAN-77 routines which performs floating-point multiple-precision arithmetic and elementary functions. Results are almost always correctly rounded, and due to improved algorithms used for elementary functions, reasonable efficiency is obtained.
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
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
BRENT, R. P. The complexity of multiple-precision arithmetic. In Complexity of Computational Problem Solwng, R. S. Anderssen and R. P. Brent, Eds., University of Queensland Press, Brisbane, 1976, 126-165.
|
 |
5
|
|
 |
6
|
|
 |
7
|
|
| |
8
|
KAHAN, W. M. And now for something completely different: The TI SR-52. Univ. of California, Berkeley Electronics Research Lab Rep. UCB/ERL M77/23, Apr. 1977.
|
| |
9
|
KAHAN, W.M. Can you count on your calculator? Univ. of California, Berkeley Electronics Research Lab. Rep. UCB/ERL M77/21, Apr. 1977.
|
| |
10
|
KAHAN, W. M. Implementation of algorithms. Univ. of California, Berkeley Computer Science Tech. Rep. 20, 1973. Also distributed by National Technical Information Service under DDC AD-769 124.
|
| |
11
|
|
| |
12
|
RAMANUJAN, S. Modular equations and approximations to ~r. Q. J. Math. 45 (1914), 350-372. Also in Collected Papers ofSrtnivasa Ramanujan, G. H. Hardy, P. V. Seshu Aiyar, and B. M. Wilson, Eds., Cambridge University Press, 1927, 23-39.
|
| |
13
|
SHANKS, D., AND WRENC~t, J.W. Calculation of ~r to 100,000 places. Math. Comput. 16 (1962), 76-99.
|
| |
14
|
SMITH, D.M. Efficient multiple-precision evaluation of elementary functions. Math. Comput. 52 (1989), 131-134.
|
|