Order relations and rigor in computing

ABSTRACT

Rigor in computing depends in many ways on the integrity of order relations. Commonly used hardware floating-point arithmetic can destroy that integrity. An available remedy is discussed with examples.

REFERENCES

• 1: http://www.cs.utep.edu/interval-comp.
• 2: http://www.cs.utep.edu/intervalcomp/abstracts/list.html.
• 3: Oliver Aberth, Precise Numerical Methods Using C++ with Cdrom, Academic Press, Inc., Orlando, FL, 1998
• 4: J. P. Eckmann, H. Koch, and P. Wittwer. A computer assisted proof of universality in area preserving maps. In Memoirs A. M. S., volume 289. 1984.
• 5: Jeffrey S. Ely , Gregory R. Baker, High-precision calculations of vortex sheet motion, Journal of Computational Physics, v.111 n.2, p.275-281, April 1994 [doi>10.1006/jcph.1994.1063]
• 6: T. C. Hales, http://www.math.pitt.edu/ thales/.
• 7: J. Hass. http://www.math.ucdavis.edu/ hass/.
• 8: Wayne B. Hayes , Kenneth R. Jackson, Rigorous Shadowing of Numerical Solutions of Ordinary Differential Equations by Containment, SIAM Journal on Numerical Analysis, v.41 n.5, p.1948-1973, 2003 [doi>10.1137/S0036142901399100]
• 9: Ulrich W. Kulisch, Advanced Arithmetic for the Digital Computer: Design of Arithmetic Units, Springer-Verlag New York, Inc., Secaucus, NJ, 2002
• 10: R. E. Moore. Mathematical elements of scientific computing, pages 3--16, 1975.
• 11: L. A. Seco. Computer assisted lower bounds for atomic energies. Computer Aided Proofs in Analysis, pages 241--251, 1991.
• 12: W. Tucker. A rigorous ode solver and smale's 14th problem. Found. Comput. Math., 2:53--117, 2002.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.0 General

General Terms:
Algorithms, Reliability, Theory

Keywords:
intervals, reliable computations