ALGORITHM 719 - MULTIPRECISION TRANSLATION AND EXECUTION OF FORTRAN PROGRAMS

被引:106
作者
BAILEY, DH
机构
[1] NAS Apphed Research Branch, NASA Ames Research Center, Moffett Field
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1993年 / 19卷 / 03期
关键词
ALGORITHMS; PERFORMANCE; MULTIPLE-PRECISION COMPUTATION; MULTIPRECISION ARITHMETIC;
D O I
10.1145/155743.155767
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:288 / 319
页数:32
相关论文
共 32 条
[1]   A HIGH-PERFORMANCE FFT ALGORITHM FOR VECTOR SUPERCOMPUTERS [J].
BAILEY, DH .
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1988, 2 (01) :82-87
[3]  
BAILEY DH, 1989, MATH COMPUT, V53, P649, DOI 10.1090/S0025-5718-1989-0979934-9
[5]  
BAILEY DH, 1990, RNR90022 NASA AM RES
[6]  
BORWEIN J. M., 1987, PI AGM STUDY ANAL NU
[7]   RAMANUJAN, MODULAR EQUATIONS, AND APPROXIMATIONS TO PI OR HOW TO COMPUTE ONE BILLION DIGITS OF PI [J].
BORWEIN, JM ;
BORWEIN, PB ;
BAILEY, DH .
AMERICAN MATHEMATICAL MONTHLY, 1989, 96 (03) :201-219
[8]   THE ARITHMETIC-GEOMETRIC MEAN AND FAST COMPUTATION OF ELEMENTARY-FUNCTIONS [J].
BORWEIN, JM ;
BORWEIN, PB .
SIAM REVIEW, 1984, 26 (03) :351-366
[9]  
Brent R. P., 1978, ACM Transactions on Mathematical Software, V4, P57, DOI 10.1145/355769.355775
[10]   FAST MULTIPLE-PRECISION EVALUATION OF ELEMENTARY FUNCTIONS [J].
BRENT, RP .
JOURNAL OF THE ACM, 1976, 23 (02) :242-251