Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- 1 September 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 19 (3) , 288-319
- https://doi.org/10.1145/155743.155767
Abstract
This paper describes two Fortran utilities for multiprecision computation. The first is a package of Fortran subroutines that perform a variety of arithmetic operations and transcendental functions on floating point numbers of arbitrarily high precision. This package is in some cases over 200 times faster than that of certain other packages that have been developed for this purpose. The second utility is a translator program, which facilitates the conversion of ordinary Fortran programs to use this package. By means of source directives (special comments) in the original Fortran program, the user declares the precision level and specifies which variables in each subprogram are to be treated as multiprecision. The translator program reads this source program and outputs a program with the appropriate multiprecision subroutine calls. This translator supports multiprecision integer, real, and complex datatypes. The required array space for multiprecision data types is automatically allocated. In the evaluation of computational expressions, all of the usual conventions for operator precedence and mixed mode operations are upheld. Furthermore, most of the Fortran-77 intrinsics, such as ABS, MOD, NINT, COS, EXP are supported and produce true multiprecision values.Keywords
This publication has 15 references indexed in Scilit:
- A precise calculation of the Feigenbaum constantsMathematics of Computation, 1991
- Exponentiation cryptosystems on the IBM PCIBM Systems Journal, 1990
- A multiprecise integer arithmetic packageThe Journal of Supercomputing, 1989
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of PiThe American Mathematical Monthly, 1989
- Numerical results on relations between fundamental constants using a new algorithmMathematics of Computation, 1989
- A High-Performance FFT Algorithm for Vector SupercomputersThe International Journal of Supercomputing Applications, 1988
- The Arithmetic-Geometric Mean and Fast Computation of Elementary FunctionsSIAM Review, 1984
- Quantitative universality for a class of nonlinear transformationsJournal of Statistical Physics, 1978
- A Fortran Multiple-Precision Arithmetic PackageACM Transactions on Mathematical Software, 1978
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976