The iRRAM: Exact arithmetic in C++

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2064, Issue , 2001, Pages 222-252

  Müller, Norbert Th ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

C++; Computable real analysis; Interval arithmetic; Limits; Multi valued functions; Multiple precision arithmetic; Random accessmachines

Indexed keywords

CESIUM; LINEAR ALGEBRA;

COMPUTABLE REALS; INTERVAL ARITHMETIC; LIMITS; MULTIPLE PRECISION ARITHMETIC; MULTIVALUED FUNCTIONS; RANDOM ACCESSMACHINES;

COMPUTABILITY AND DECIDABILITY;

EID: 84974733588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45335-0_14     Document Type: Conference Paper

References (32)

1. 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
2. J.M. Borwein and P.B. Borwein, Pi and the AGM, A study in analytic number theory, Wiley, New York, 1987
3. 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)
4. 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
5. 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
6. R.P. Brent, Fast multiple precision evaluation of elementary functions, J. ACM 23 (1976) 242-251
7. R.P. Brent, A Fortran multiple precision package, ACM Trans. Math. Software 4 (1978), pp 57-70
8. V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoret. Comput. Sci. 162 (1996),47-77
9. V. Brattka and P. Hertling, Feasible Real Random Access Machines, Informatik Berichte 193 12/1995, FernUniversität Hagen
10. V. Brattka and P. Hertling, Continuity and Computability of Relations, Informatik Berichte 164 9/1994, FernUniversitätHagen
11. V. Brattka, Recursive and Computable Operations over Topological Structures, Thesis, Informatik Berichte 255 7/1999, FernUniversitätHagen
12. S.A. Cook and S.O. Aanderaa,On the minimum computation time of functions, Trans. Amer.Math. Soc. 142 (1969) 291-314
13. 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: www.elsevier.nl/locate/entcs/volume6.html
14. M.J. Fischer and L.J. Stockmeyer, Fast on-line integer multiplication, J. Comput. System Scis. 9 (1974) 317-331
15. T. Granlund, GMP 3.1.1, http://www.swox.com/gmp/
16. P. Gowland and D. Lester, 2, 4th Conference on Real Numbers and Computers, 2000, Dagstuhl, 125-140
17. S. Heinrich, E. Novak et al., The Inverse of the Star-Discrepancy depends linearly on the Dimension, Acta Arithmetica, to appear
18. R. Klatte, U. Kulisch et al., C-XSC, a C++ Class Library for Extended Scientific Computing (Springer, Berlin 1993)
19. K. Ko, Complexity Theory of Real Functions, (Birkhäuser, Boston 1991)
20. U. Kulisch, Memorandum über Computer, Arithmetik und Numerik (Universität Karlsruhe, Institut für angewandteMathematik)
21. V. Ménissier-Morain, Arbitrary precision real arithmetic: design and algorithms, J. Symbolic Computation, 1996, 11
22. N.Th. Müller, Untersuchungen zur Komplexität reeller Funktionen, Dissertation (Fern-Universität Hagen, 1988)
23. 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)
24. 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)
25. N.Th. Müller, Towards a real RealRAM: a Prototype using C++, Proc. 6th International Conference on Numerical Analysis, Plovdiv, 1997
26. N.Th. Müller, Implementing limits in an interactive RealRAM, 3rd Conference on Real Numbers and Computers, 1998, Paris, 13-26
27. M. Riordan, ftp://ripem.msu.edu/pub/bignum/BIGNUMS.TXT Sch90. A. Schönhage, Numerik analytischer Funktionen und Komplexität, Jber. d. Dt. Math.-Verein. 92 (1990) 1-20
28. J.V. Tucker, J.I. Zucker, Computation by ‘While’ programs on topological partial algebras, Theoretical Computer Science 219 (1999) 379-420
29. K. Weihrauch, Computability (volume 9 of: EATCS Monographs on Theoretical Computer Science), (Springer, Berlin, 1987)
30. K.Weihrauch, A Simple Introduction to Computable Analysis, Informatik Berichte 171-2/1995, FernUniversitätHagen
31. K.Weihrauch, A Foundation for ComputableAnalysis, Proc.DMTCS’96, (Springer, Singapore, 1997) 66-89
32. 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/