A survey of exact arithmetic implementations

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

Volumn 2064, Issue , 2001, Pages 30-47

  Gowland, Paul ^a   Lester, David ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; USER INTERFACES;

COMPETING SYSTEMS; EXACT ARITHMETIC; PRACTICAL SYSTEMS;

SURVEYS;

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

References (56)

1. Errett Bishop and Douglas S. Bridges. Constructive Analysis, volume 279 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin, 1985.
2. H. Boehm and R. Cartwright. Exact real arithmetic: Formulating real numbers as functions. In D.A. Turner, editor,, Research Topics in Functional Programming, University of Texas at Austin Year of Programming, pages 43-64. Addison-Wesley, 1990.
3. D. Berthelot and M. Daumas. Computing on sequences of embedded intervals. Reliable Computing, 3(3):219-227, 1997.
4. J.-C. Bajard, M.D. Ercegovac, L. Imbert, and F. Rico. Fast evaluation of elementary functions with combined shift-and-add polynomial methods. In Fourth Conference on Real Numbers and Computers, pages 75-87, Schloss Dagstuhl, Saarland, Germany, April 2000.
5. Vasco Brattka and Peter Hertling. Feasible real random access machines. Journal of Complexity, 14(4):490-526, 1998.
6. J. Blanck. Exact real arithmetic systems: results of competion. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors,, Computability and Complexity in Analysis 2000, Berlin, 2001. Springer.
7. R.P. Brent. Fast multiple precision evaluation of elementary functions. Journal of the ACM, 23:242-251, 1976.
8. R.P. Brent. A Fortran multiple precision package. ACM Transactions on Mathematical Software, 4:57-70, 1978.
9. L. Blum and M. Shub. Evaluating rational functions: Infinite precision is finite cost and tractable on average. SIAM Jounal of Computing, 15(2):384-398, 1986.
10. 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 American Mathematical Society, 21(1), July 1989.
11. A. Cuyt, P. Kuterna, P.B. Verdonk, and J. Vervloet. The class library for exact rational arithmetic in ARIMO. In Proceedings of the Fourth Real Numbers and Computers, pages 141-160, 2000.
12. Abbas Edalat and Peter John Potts. A new representation for exact real numbers. Electronical Notes in Theoretical Computer Science, 6:14 pp., 1997. Mathematical foundations of programming semantics (Pittsburgh, PA, 1997).
13. C.F. Gauss. Disquisitiones generales circa seriem inńitam 1 + αβ/1.rx+α(α+1)β(β+1)/1.2r(r+1)xx+ α(α+1)(α+2)β(β+1)(β+2)/1.2.3.r(r+1)(r+2)x3etc. pars prior. In Werke, volume 3, pages 123-162. Königlichen Gesellschaft der Wissenschaften, Göttingen, 1812.
14. P. Gowland and D. Lester. The correctness of an implementation of exact arithmetic. In Proceedings of the Fourth Real Numbers and Computers Conference, pages 125-140, 2000.
15. R.W. Gosper. Continued fraction arithmetic. HAKMEM 101b, MIT, 1972.
16. R.W. Gosper. Continued fraction arithmetic. Unpublished Draft Paper, 1977.
17. Andrzej Grzegorczyk. Computable functionals. FundamentaMathematicae, 42:168-202, 1955.
18. Andrzej Grzegorczyk. On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61-71, 1957.
19. Andrzej Grzegorczyk. Some approaches to constructive analysis. In A. Heyting, editor,, Constructivity in mathematics, Studies in Logic and The Foundations of Mathematics, pages 43-61, Amsterdam, 1959. North-Holland. Colloquium at Amsterdam, 1957.
20. J. Harrison. Theorem Proving with the Real Numbers. Springer-Verlag, London, 1998.
21. T.E. Hull. The use of controlled precision. The Relationship Between Numerical Computation and Programming Languages, pages 71-84, 1982.
22. A. Hurwitz. Über die Entwicklung Komplexer Grössen in Kettenbrüche. Acta Mathematica, 11:187-200, 1888.
23. A. Hurwitz. Über eine besondere Art der Kettenbruch-Entwicklung reeller Grössen. Acta Mathematica, 12:367-405, 1889.
24. IEEE, New York. IEEE Standard for Binary Floating-point Arithmetic, IEEE Standard 754-1985, 1985.
25. IEEE, New York. IEEE Standard for Radix and Format Independent Floating-point Arithmetic, IEEE Standard 854-1994, 1994.
26. P. Kornerup and D.W. Matula. An on-line arithmetic unit for bitpipelined rational arithmetic. Journal of Parallel and Distributed Computing, 5(3):310-330, 1988.
27. P. Kornerup and D.W. Matula. An algorithm for redundant binary bit-pipelined rational arithmetic. IEEE Transactions on Computers, 39(8):1106-1115, 1990.
28. Ker-I Ko. On the continued fraction representation of computable real numbers. Theoretical Computer Science, 47:299-313, 1986. corr. ibid., Vol. 54 (1987), Pages 341-343.
29. Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
30. W. Krämer. A priori worst case error bounds for floating-point computations. IEEE Transactions on Computers, 47(7):750-756, 1998.
31. Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles I. Comptes Rendus Académie des Sciences Paris, 240:2478-2480, June 1955. Théorie des fonctions.
32. Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles II. Comptes Rendus Académie des Sciences Paris, 241:13-14, July 1955. Théorie des fonctions.
33. Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles III. Comptes Rendus Académie des Sciences Paris, 241:151-153, July 1955. Théorie des fonctions.
34. Daniel Lacombe. Sur les possibilites d’extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles. In Le raisonnement en mathematiques et en sciences, pages 67-75, Paris, 1958. Editions du Centre National de la Recherche Scientifique. Colloques Internationaux du Centre National de la Recherche Scientifique, LXX.
35. V.A. Lee, Jr and H.J. Boehm. Optimizing programs over the constructive reals. In Proceedings of The ACM SIGPLAN’ 90 Conference on Programming Language, Design and Implementation, pages 102-111, 1990.
36. D. Lester. Effective continued fractions. In Proceedings of the Fifteenth IEEE Arithmetic Conference, June 2001.
37. Salah Labhalla and Henri Lombardi. Real numbers, continued fractions, and complexity classes. Annals of Pure and Applied Logic, 50:1-28, 1990.
38. A.A. Markov. On the continuity of constructive functions (Russian). Uspekhi Mat. Nauk (N.S.), 9:226-230, 1954.
39. V. Ménissier-Morain. Arithmétique Exacte. PhD thesis, L’Université Paris VII, December 1994.
40. A. Mostowski. On computable sequences. Fundamenta Mathematicae, 44:37-51, 1957.
41. Norbert Th. Müller. Subpolynomial complexity classes of real functions and real numbers. In Laurent Kott, editor,, Proceedings of the 13th International Colloquium on Automata, Languages, and Programming, volume 226 of Lecture Notes in Computer Science, pages 284-293, Berlin, 1986. Springer.
42. Norbert Th. Müller. Implementing limits in an interactive RealRAM. In J.-M. Chesneaux, F. Jézéquel, J.-L. Lamotte, and J. Vignes, editors,, Third Real Numbers and Computers Conference, pages 59-66. Université Pierre et Marie Curie, Paris, 1998. Paris, France, April 27-29, 1998.
43. J. M. Muller. Some algebraic properties of floating-point arithmetic. In Proceedings of the Fourth Real Numbers and Computers, pages 31-38, 2000.
44. Norbert Th.Müller. The iRRAM: Exact arithmetic in C++. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors,, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 319-350. FernUniversität Hagen, September 2000. CCA2000 Workshop, Swansea, Wales, September 17-19, 2000.
45. J. Myhill. What is a real number? The American Mathematical Monthly, 79:748-754, 1972.
46. Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
47. E.D. Popova. On a formally correct implementation of IEEE computer arithmetic. Journal of Universal Computer Science, 1(7):560-569, 1995.
48. P.J. Potts. Exact Real Arithmetic using Möbius Transformations. PhD thesis, Imperial College of Science, Technology and Medicine, London University, March 1999.
49. H. Rice. Recursive real numbers. Proc. Amer. Math. Soc., 5:784-791, 1954.
50. R.M. Robinson. Review of "Peter, R., Rekursive Funktionen". The Journal of Symbolic Logic, 16:280-282, 1951.
51. D.M. Smith. ALGORITHM 693, A FORTRAN package for floating-point multiple-precision arithmetic. ACM Transactions on Mathematical Software, 17(2):273-283, 1991.
52. J. Vuillemin. Exact real computer arithmetic with continued fractions. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 14-27, Snowbird, Utah, 25-27 July 1988.
53. Klaus Weihrauch. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987.
54. Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.
55. KlausWeihrauch and Christoph Kreitz. Representations of the real numbers and of the open subsets of the set of real numbers. Annals of Pure and Applied Logic, 35:247-260, 1987.
56. P. Zimmermann. MPFR: A library for multiprecision floating-point arithmetic with exact rounding. In Fourth Conference on Real Numbers and Computers, pages 89-90, Schloss Dagstuhl, Saarland, Germany, April 2000.