Nothing Special   »   [go: up one dir, main page]

Skip to main content

Complete Interval Arithmetic and Its Implementation on the Computer

  • Conference paper
Numerical Validation in Current Hardware Architectures

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5492))

Abstract

Let \(I\textit{I \kern-.55em R}\) be the set of closed and bounded intervals of real numbers. Arithmetic in \(I\textit{I \kern-.55em R}\) can be defined via the power set \(\textit{I \kern-.54em P}\textit{I \kern-.55em R}\) of real numbers. If divisors containing zero are excluded, arithmetic in \(I\textit{I \kern-.55em R}\) is an algebraically closed subset of the arithmetic in \(\textit{I \kern-.54em P}\textit{I \kern-.55em R}\), i.e., an operation in \(I\textit{I \kern-.55em R}\) performed in \(\textit{I \kern-.54em P}\textit{I \kern-.55em R}\) gives a result that is in \(I\textit{I \kern-.55em R}\). Arithmetic in \(\textit{I \kern-.54em P}\textit{I \kern-.55em R}\) also allows division by an interval that contains zero. Such division results in closed intervals of real numbers which, however, are no longer bounded. The union of the set \(I\textit{I \kern-.55em R}\) with these new intervals is denoted by \((I\textit{I \kern-.55em R})\). This paper shows that arithmetic operations can be extended to all elements of the set \((I\textit{I \kern-.55em R})\).

Let \(F \subset \textit{I \kern-.55em R}\) denote the set of floating-point numbers. On the computer, arithmetic in \((I\textit{I \kern-.55em R})\) is approximated by arithmetic in the subset (IF) of closed intervals with floating-point bounds. The usual exceptions of floating-point arithmetic like underflow, overflow, division by zero, or invalid operation do not occur in (IF).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic Press, New York (1983)

    MATH  Google Scholar 

  2. Kahan, W.: A More Complete Interval Arithmetic. Lecture Notes prepared for a summer course at the University of Michigan, June 17-21 (1968)

    Google Scholar 

  3. Kirchner, R., Kulisch, U.: Hardware support for interval arithmetic. Reliable Computing 12(3), 225–237 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kulisch, U.W.: Computer Arithmetic and Validity – Theory, Implementation and Applications. De Gruyter, Berlin (2008)

    Book  MATH  Google Scholar 

  5. IFIPWG-IEEE754R: Letter of the IFIP WG 2.5 to the IEEE Computer Arithmetic Revision Group (2007)

    Google Scholar 

  6. Moore, R.E.: Interval Analysis. Prentice Hall Inc., Englewood Cliffs (1966)

    MATH  Google Scholar 

  7. Moore, R.E.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)

    Book  MATH  Google Scholar 

  8. Ratz, D.: On Extended Interval Arithmetic and Inclusion Isotony, Institut für Angewandte Mathematik, Universität Karlsruhe (preprint, 1999)

    Google Scholar 

  9. Rump, S.M.: Kleine Fehlerschranken bei Matrixproblemen. Dissertation, Universität Karlsruhe (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kulisch, U.W. (2009). Complete Interval Arithmetic and Its Implementation on the Computer. In: Cuyt, A., Krämer, W., Luther, W., Markstein, P. (eds) Numerical Validation in Current Hardware Architectures. Lecture Notes in Computer Science, vol 5492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01591-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01591-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01590-8

  • Online ISBN: 978-3-642-01591-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics