Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-06T13:21:34.496Z Has data issue: false hasContentIssue false
  • English
  • Français

RealLib: An efficient implementation of exact real arithmetic

Published online by Cambridge University Press:  01 February 2007

BRANIMIR LAMBOV
BRANIMIR LAMBOV*
Affiliation:
BRICS, University of Aarhus, IT Parken, 8200 Aarhus N, Denmark Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is an introduction to the RealLib package for exact real number computations. The library provides certified accuracy, but tries to achieve this at performance close to the performance of hardware floating point for problems that do not require higher precision. The paper gives the motivation and features of the design of the library and compares it with other packages for exact real arithmetic.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 17 , Issue 1 , February 2007 , pp. 81 - 98
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aberth, O. (1974) A precise numerical analysis program. Communications of the ACM 17 (9)509–513.Google Scholar
Aberth, O. (1988) Precise Numerical Analysis, Wm. C. Brown Publishers.Google Scholar
Aberth, O. and Schaefer, M. J. (1992) Precise computation using range arithmetic, via C++. ACM Trans. Math. Softw. 18 (4)481–491.CrossRefGoogle Scholar
Brattka, V. and Hertling, P. (1998) Feasible Real Random Access Machines. Journal of Complexity 14 (4)490–526.Google Scholar
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.)Google Scholar
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.)Google Scholar
Edalat, A. and Sünderhauf, P. (1999) A domain-theoretic approach to computability on the real line. Theoretical Computer Science 210 (1)73–98.CrossRefGoogle Scholar
Grzegorczyk, A. (1957) On the definitions of computable real continuous functions. Fundamenta Matematicae 44 61–67.Google Scholar
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.Google Scholar
Ko, K.-I. (1991) Complexity Theory of Real Functions, Birkhäuser.CrossRefGoogle Scholar
Lambov, B. (2005) Complexity and Intensionality in a Type-1 Framework for Computable Analysis. Springer-Verlag Lecture Notes in Computer Science 3634 442–461.CrossRefGoogle Scholar
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.Google Scholar
Mehlhorn, K. and Schirra, S. (2000) Generalized and improved constructive separation bound for real algebraic expressions. Research Report, Max-Planck-Institut für Informatik.Google Scholar
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/.)CrossRefGoogle Scholar
Pour-El, M. B. and Richards, J. I. (1989) Computability in Analysis and Physics, Springer-Verlag.CrossRefGoogle Scholar
Weihrauch, K. (2000) Computable Analysis, Springer-Verlag.CrossRefGoogle Scholar