RealLib: An efficient implementation of exact real arithmetic

Mathematical Structures in Computer Science

Volumn 17, Issue 1, 2007, Pages 81-98

  Lambov, Branimir ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE; PROBLEM SOLVING;

REAL ARITHMETIC;

NUMBER THEORY;

EID: 33847707016     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005822     Document Type: Conference Paper

References (16)

1. Aberth, O. (1974) A precise numerical analysis program. Communications of the ACM 17 (9) 509-513.
2. Aberth, O. (1988) Precise Numerical Analysis, Wm. C. Brown Publishers.
3. Aberth, O. and Schaefer, M. J. (1992) Precise computation using range arithmetic, via C++. ACM Trans. Math. Softw. 18 (4) 481-491.
4. Brattka, V. and Hertling, P. (1998) Feasible Real Random Access Machines. Journal of Complexity 14 (4) 490-526.
5. Briggs, K. (to appear) Implementing exact real arithmetic in python, C++ and C. To appear in Journal of theoretical computer science. (See also http://keithbriggs.info/xrc.html.)
6. Edalat, A. (2001) Exact Real Number Computation Using Linear Fractional Transformations. Final Report on EPSRC grant GR/L43077/01. (Available at http://www.doc.ic.ac.uk/~ae/exact- computation/exactarithmeticfinal.ps.gz.)
7. Edalat, A. and Sünderhauf, P. (1999) A domain-theoretic approach to computability on the real line. Theoretical Computer Science 210 (1) 73-98.
8. Grzegorczyk, A. (1957) On the definitions of computable real continuous functions. Fundamenta Matematicae 44 61-67.
9. Hida, Y., Li, X. S. and Bailey, D. H. (2001) Algorithms for Quad-Double Precision Floating Point Arithmetic. 15th IEEE Symposium on Computer Arithmetic, IEEE Computer Society, 155-162.
10. Ko, K.-I. (1991) Complexity Theory of Real Functions, Birkhäuser.
11. Lambov, B. (2005) Complexity and Intensionality in a Type-1 Framework for Computable Analysis. Springer-Verlag Lecture Notes in Computer Science 3634 442-461.
12. Lee, V. A. Jr. and Boehm, H.-J. (1990) Optimizing Programs over the Constructive Reals. In: Conference on Programming Language Design and Implementation, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, ACM Press 102-111.
13. Mehlhorn, K. and Schirra, S. (2000) Generalized and improved constructive separation bound for real algebraic expressions. Research Report, Max-Planck-Institut für Informatik.
14. Müller, N. (2001) The iRRAM: Exact arithmetic in C++. Computability and complexity in analysis (Swansea 2000). Springer-Verlag Lecture Notes in Computer Science 2064. (See also http://www.informatik.uni-trier.de/ iRRAM/.)
15. Pour-El, M. B. and Richards, J. I. (1989) Computability in Analysis and Physics, Springer-Verlag.
16. Weihrauch, K. (2000) Computable Analysis, Springer-Verlag.