Abstract
The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.H. Bailey, The computation of π to 29,360,000 Decimal Digits Using Borweins Quartically Convergent Algorithm Mathematics of Computation Vol. 50 Number 181 (1988) 238–296
J.M. Borwein and P.B. Borwein, Pi and the AGM, A study in analytic number theory, Wiley, New York, 1987
H. Boehm and R. Cartwright, Exact Real Arithmetic: Formulating real numbers as functions. In T. D., editor, Research Topics in Functional Programming, 43–64 (Addison-Wesley, 1990)
L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bulletin of the AMS 21, 1, July 1989
R.P. Brent, The complexity of multiple precision arithmetic, Proc. Seminar on Complexity of Computational Problem Solving, Queensland U. Press, Brisbane, Australia (1975) 126–165
R.P. Brent, Fast multiple precision evaluation of elementary functions, J. ACM 23 (1976) 242–251
R.P. Brent, A Fortran multiple precision package, ACM Trans. Math. Software 4 (1978), pp 57–70
V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoret. Comput. Sci. 162 (1996),47–77
V. Brattka and P. Hertling, Feasible Real Random Access Machines, Informatik Berichte 193-12/1995, FernUniversität Hagen
V. Brattka and P. Hertling, Continuity and Computability of Relations, Informatik Berichte 164-9/1994, FernUniversitätHagen
V. Brattka, Recursive and Computable Operations over Topological Structures, Thesis, Informatik Berichte 255-7/1999, FernUniversitätHagen
S.A. Cook and S.O. Aanderaa,On the minimum computation time of functions, Trans. Amer.Math. Soc. 142 (1969) 291–314
A. Edalat and P. Potts, A new representation for exact real numbers, Proc. ofMathematical Foundations of Programming Semantics 13, Electronic notes in Theoretical Computer Science 6, Elsevier Science B.V., 1997, URL: http://www.elsevier.nl/locate/entcs/volume6.html
M.J. Fischer and L.J. Stockmeyer, Fast on-line integer multiplication, J. Comput. System Scis. 9 (1974) 317–331
T. Granlund, GMP 3.1.1, http://www.swox.com/gmp/
P. Gowland and D. Lester, The Correctness of an Implementation of Exact Arithmetic, 4th Conference on Real Numbers and Computers, 2000, Dagstuhl, 125–140
S. Heinrich, E. Novak et al., The Inverse of the Star-Discrepancy depends linearly on the Dimension, Acta Arithmetica, to appear
R. Klatte, U. Kulisch et al., C-XSC, a C++ Class Library for Extended Scientific Computing (Springer, Berlin 1993)
K. Ko, Complexity Theory of Real Functions, (Birkhäuser, Boston 1991)
U. Kulisch, Memorandum über Computer, Arithmetik und Numerik (Universität Karlsruhe, Institut für angewandteMathematik)
V. Ménissier-Morain, Arbitrary precision real arithmetic: design and algorithms, J. Symbolic Computation, 1996, 11
N.Th. Müller, Untersuchungen zur Komplexität reeller Funktionen, Dissertation (Fern-Universität Hagen, 1988)
N.Th. Müller, Polynomial Time Computation of Taylor Series,Proc. 22 JAIIO-PANEL’ 93, Part 2, Buenos Aires, 1993, 259–281 (also available at http://www.informatik.uni-trier.de/~mueller)
N.Th. Müller, Towards a real Real RAM: a Prototype using C++, (preliminary version), Second Workshop on Constructivity and Complexity in Analysis, Forschungsbericht Mathematik-Informatik, Universität Trier 96-44, Seiten 59–66 (1996) (also available at http://www.informatik.uni-trier.de/~mueller)
N.Th. Müller, Towards a real RealRAM: a Prototype using C++, Proc. 6th International Conference on Numerical Analysis, Plovdiv, 1997
N.Th. Müller, Implementing limits in an interactive RealRAM, 3rd Conference on Real Numbers and Computers, 1998, Paris, 13–26
M. Riordan, ftp://ripem.msu.edu/pub/bignum/BIGNUMS.TXT
A. Schönhage, Numerik analytischer Funktionen und Komplexität, Jber. d. Dt. Math.-Verein. 92 (1990) 1–20
J.V. Tucker, J.I. Zucker, Computation by ‘While’ programs on topological partial algebras, Theoretical Computer Science 219 (1999) 379–420
K. Weihrauch, Computability (volume 9 of: EATCS Monographs on Theoretical Computer Science), (Springer, Berlin, 1987)
K. Weihrauch, A Simple Introduction to Computable Analysis, Informatik Berichte 171-2/1995, FernUniversitätHagen
K. Weihrauch,A Foundation for ComputableAnalysis, Proc.DMTCS’96, (Springer, Singapore, 1997) 66–89
Zi00.P. Zimmermann, MPFR: A Library for Multiprecision Floating-Point Arithmetic with Exact Rounding, 4th Conference on Real Numbers and Computers, 2000, Dagstuhl, 89–90, see also http://www.loria.fr/projets/mpfr/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, N.T. (2001). The iRRAM: Exact Arithmetic in C++. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-45335-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42197-9
Online ISBN: 978-3-540-45335-2
eBook Packages: Springer Book Archive