Algorithm 719: Multiprecision translation and execution of FORTRAN programs

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.

REFERENCES

• 1: BAILEY, D.H. The computation of ~ to 29,360,000 decimal digits using Borwems' quartically convergent algorithm. Math. Comput. 50 (Jan. 1988), 283 296.
• 2: BAILEY, D. H. A high performance FFT algorithm for vector supercomputers. Int. J. Supercomput. Appl. 2 (Spring 1988), 82-87.
• 3: BAILEY, D. H. Numerical results on the transcendence of constants involving ~r, e, and Euler's constant. Math. Comput. 50 (Jan. 1988), 275-281.
• 4: BAILEY, D.H. A portable high performance multiprecision package. Tech. Rep. RNR-90-022, NASA Ames Research Center, 1990.
• 5: BAILEY, D. IX., AND FERGUSON, H. R.P. Numerical results on relations between numerical constants using a new algorithm. Math. Comput. 53 (Oct. 1989), 649-656.
• 6: BECKMANN, P. A History ofPi. Golem Press, Boulder, Colo., 1977
• 7: BORWEIN, J. M., AND BORWEIN, P.B. The arithmetic-geometric mean and fast computation of elementary functions. SIAM Rev. 26 (1984), 351-365.
• 8: BORWEIN, J. M., AND BORWEIN, P.B. Pi and the AGM. Wiley, New York, 1987.
• 9: J. M. Borwein , P. B. Borwein , D. H. Bailey, Ramanujan, modular equations, and approximations to Pi or how to compute one billion digits of Pi, American Mathematical Monthly, v.96 n.3, p.201-219, March 1989 [doi>10.2307/2325206]
• 10: Richard P. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, Journal of the ACM (JACM), v.23 n.2, p.242-251, April 1976 [doi>10.1145/321941.321944]
• 11: Richard P. Brent, A Fortran Multiple-Precision Arithmetic Package, ACM Transactions on Mathematical Software (TOMS), v.4 n.1, p.57-70, March 1978 [doi>10.1145/355769.355775]
• 12: BRENT, R. P. Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In Analytic Computational Complexity, Academic Press, New York, 1976, 151-176.
• 13: BRIGGS, K. A precise calculation of the Feigenbaum constants. Math. Comput. 57 (1991), 435-439.
• 14: BUELL, D., AND WARD, R. A multiprecise integer arithmetic package. J. Supercomput. 3 (1989), 89-107.
• 15: CHUDNOVSKY, D. V., AND CHUDNOVSKY, G.V. Computation and arithmetic nature of classical constants IBM Res. Rep. IBM T. J. Watson Research Center, RC14950 (66818), 1989.
• 16: CHUDNOVSKY, D. V., AND CHUDNOVSKY, G.V. Personal communication, 1991.
• 17: P. G. Comba, Exponentiation cryptosystems on the IBM PC, IBM Systems Journal, v.29 n.4, p.526-538, 1990
• 18: Jack Dongarra, The LINPACK Benchmark: An Explanation, Proceedings of the 1st International Conference on Supercomputing, p.456-474, June 08-12, 1987
• 19: FEINGENBAUM, M. J. Quantitative universality for a class of nonlinear transformations. J. Stat. Phys. 19 (1978), 25-52.
• 20: FERGUSON, H. R. P., AND BArnEY, D. H. A polynomial time, numerically stable integer relation algorithm. Tech. Rep. RNR-91-032, NAS Applied Research Branch, NASA Ames Research Center, Moffett Field, Calif., Mar. 1992.
• 21: J. Håstad , B. Just , J. C. Lagarias , C. P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, SIAM Journal on Computing, v.18 n.5, p.859-881, Oct. 1989 [doi>10.1137/0218059]
• 22: KANADA, Y. Personal communication, 1989.
• 23: Donald Ervin Knuth, The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1978
• 24: Robert Krasny, Desingularization of periodic vortex sheet roll-up, Journal of Computational Physics, v.65 n.2, p.292-313, Aug. 1986 [doi>10.1016/0021-9991(86)90210-X]
• 25: A. K. Lenstra , H. W. Lenstra, Jr. , M. S. Manasse , J. M. Pollard, The number field sieve, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.564-572, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100295]
• 26: ODLYZKO, A. M., AND TE RIELE, H. J.J. Disproof of the Mertens conjecture. J. Reine Angew. Math. 357 (1985), 138 160.
• 27: R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
• 28: SALAMIN, E. Computation of ~ using arithmetic-geometric mean. Math. Comput. 30 (1976), 565-570.
• 29: SLOWINSKI, n. Personal communication, 1991.
• 30: David M. Smith, Algorithm 693; a FORTRAN package for floating-point multiple-precision arithmetic, ACM Transactions on Mathematical Software (TOMS), v.17 n.2, p.273-283, June 1991 [doi>10.1145/108556.108585]
• 31: Richard S. Varga, Scientific Computations on Mathematical Problems and Conjectures, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990
• 32: Stephen Wolfram, Mathematica: a system for doing mathematics by computer, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS

General Terms:
Algorithms, Performance

Keywords:
multiple-precision computation, multiprecision arithmetic