An arbitrary precision real arithmetic package in REDUCE

  • Tateaki Sasaki
9. Symbolic-Numeric Interface
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)


A REDUCE arbitrary precision real arithmetic package is described which will become a part of the kernel of an algebraic-numeric system being developed for REDUCE. The basic design principles of this package are first, it is as efficient as possible in both calculation speed and memory usage, second, even a casual user can use it, and third, it is highly portable and extensible. Our idea to attain the first property is to represent the arbitrary precision real number in as short a form as possible and to handle the precision in a much more flexible manner than any other similar system. A comparison is made of our scheme with a conventional one which uses a global precision, verifying the efficiency of our scheme. Our package contains two sets of routines for elementary arithmetic operations such as addition or multiplication. An expert user can write efficient programs using the first set of routines, while a casual user may use the second set of routines with less programming effort. Our package will become faster by rewriting only four basic and simple routines machine-dependently.


Arithmetic Operation Arbitrary Precision Variable Precision Taylor Series Method Basic Design Principle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. S. Brown and A. C. Hearn, "Applications of Symbolic Algebraic Computation," Computer Phys. Commun. (to be published).Google Scholar
  2. [2]
    P. L. Richman, "Automatic Error Analysis for Determining Precision," CACM 15, pp.813–817 (1972).Google Scholar
  3. [3]
    J. R. Pinkert, "Interval Arithmetic Applied to Polynomial Remainder Sequences," Proc. ACM SYMSAC '76, pp.214–218 (1976).Google Scholar
  4. [4]
    J. R. Pinkert, "SAC-1 Variable Precision Floating Point Arithmetic," Proc. ACM 75, pp.274–276 (1975).Google Scholar
  5. [5]
    R. J. Fateman, "The MACSYMA "Big-Floating-Point" Arithmetic System," Proc. ACM SYMSAC '76, pp.209–213 (1976).Google Scholar
  6. [6]
    Y. Kanada, private communication.Google Scholar
  7. [7]
    W. T. Wyatt Jr., D. W. Lozier and D. J. Orsen, "A Portable Extended Precision Arithmetic Package and Library with FORTRAN Precompiler," Mathematical Software II, Purdue University, May 1974.Google Scholar
  8. [8]
    R. P. Brent, "A FCRTRAN Multiple-Precision Arithmetic Package," ACM Trans. Math. Software 4, pp.57–70 (1978).Google Scholar
  9. [9]
    A. C. Hearn, "REDUCE-2 User's Manual," University of Utah, 1973.Google Scholar
  10. [10]
    J. B. Marti, A. C. Hearn, M. L. Griss and C. Griss, "Standard LISP Report," University of Utah, Jan. 1978.Google Scholar
  11. [11]
    M. L. Griss, "The Definition and Use of Data Structures in REDUCE," Proc. ACM SYMSAC '76, pp.53–59.Google Scholar
  12. [12]
    R. P. Brent, "Fast Multiple-Precision Evaluation of Elementary Functions," JACM 23, pp.242–251 (1976).Google Scholar
  13. [13]
    T. Sasaki, "Manual for Arbitrary Precision Real Arithmetic System in REDUCE," Operating Report of Symbolic Computation Group, University of Utah, May 1979.Google Scholar
  14. [14]
    J. P. Fitch, private communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Tateaki Sasaki
    • 1
  1. 1.Department of Computer ScienceThe University of UtahSalt Lake CityUSA

Personalised recommendations