Skip to main content Accessibility help
×
Home

RealLib: An efficient implementation of exact real arithmetic

  • BRANIMIR LAMBOV (a1)

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.

Copyright

References

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

Related content

Powered by UNSILO

RealLib: An efficient implementation of exact real arithmetic

  • BRANIMIR LAMBOV (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.