Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 7
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Wei, Shuai Tang, Enyi Liu, Tianyu Muller, Norbert Th. and Chen, Zhenyu 2014. 2014 Eighth International Conference on Software Security and Reliability. p. 216.

    Farjudian, Amin 2013. On the Kolmogorov complexity of continuous real functions. Annals of Pure and Applied Logic, Vol. 164, Issue. 5, p. 566.

    Berger, Ulrich and Kahle, Reinhard 2011. From coinductive proofs to exact real arithmetic: theory and applications. Logical Methods in Computer Science, Vol. 7, Issue. 1,

    Bauer, Andrej and Kavkler, Iztok 2009. A constructive theory of continuous domains suitable for implementation. Annals of Pure and Applied Logic, Vol. 159, Issue. 3, p. 251.

    Bauer, A. and Stone, C. A. 2009. RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice. Journal of Logic and Computation, Vol. 19, Issue. 1, p. 17.

    BAUER, ANDREJ and TAYLOR, PAUL 2009. The Dedekind reals in abstract Stone duality. Mathematical Structures in Computer Science, Vol. 19, Issue. 04, p. 757.

    Bauer, Andrej and Kavkler, Iztok 2008. Implementing Real Numbers With RZ. Electronic Notes in Theoretical Computer Science, Vol. 202, p. 365.

  • Mathematical Structures in Computer Science, Volume 17, Issue 1
  • February 2007, pp. 81-98

RealLib: An efficient implementation of exact real arithmetic

  • DOI:
  • Published online: 01 February 2007

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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

O. Aberth (1974) A precise numerical analysis program. Communications of the ACM 17 (9) 509513.

O. Aberth and M. J. Schaefer (1992) Precise computation using range arithmetic, via C++. ACM Trans. Math. Softw. 18 (4) 481491.

V. Brattka and P. Hertling (1998) Feasible Real Random Access Machines. Journal of Complexity 14 (4) 490526.

A. Edalat and P. Sünderhauf (1999) A domain-theoretic approach to computability on the real line. Theoretical Computer Science 210 (1) 7398.

K.-I. Ko (1991) Complexity Theory of Real Functions, Birkhäuser.

B. Lambov (2005) Complexity and Intensionality in a Type-1 Framework for Computable Analysis. Springer-Verlag Lecture Notes in Computer Science 3634 442461.

V. A. Lee Jr. and H.-J. Boehm (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 Press102111.

M. B. Pour-El and J. I. Richards (1989) Computability in Analysis and Physics, Springer-Verlag.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *