Skip to main content
Log in

A sufficient condition for non-overestimation in interval arithmetic

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The range of an arithmetic expression on an interval can be estimated by evaluating the expression using interval arithmetic. This gives always a superset of the range, which is usually proper. However, there are cases where no overestimation error occurs. The subject of this paper is to study such cases systematically and to give a sufficient condition when interval evaluation yields the exact range. Testing the condition is inexpensive: Given the intermediate values which are obtained during the evaluation of the expression, only some comparisons and bookkeeping but no additional arithmetic operations need to be performed. We show that for certain classes of expressions there is no overestimation if the input interval has a sufficiently large distance to zero. Formulae for the minimal distance are derived for polynomials in Horner form and in factorized form.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alefeld, G., Herzberger, J.: Introduction to interval computations. New York: Academic Press 1983.

    Google Scholar 

  2. Hammer, R., Hocks, M., Kulisch, U., Ratz, D.: Numerical toolbox for verified computing I. Berlin, Heidelberg, New York, Tokyo: Springer 1993.

    Google Scholar 

  3. Hansen, E.: Global optimization using interval analysis. New York: Marcel Dekker 1992.

    Google Scholar 

  4. Moore, R. E.: Interval analysis. Englewood Cliffs: Prentice-Hall New York: 1966.

    Google Scholar 

  5. Moore, R. E.: Methods and applications of interval analysis. Philadelphia: SIAM 1979.

    Google Scholar 

  6. Neumaier, A.: Interval methods for systems of equations. Cambridge: Cambridge University Press, 1990.

    Google Scholar 

  7. Ratschek, H., Rokne, J.: Computer methods for the range of functions. Chichester: Ellis Horwood 1984.

    Google Scholar 

  8. Ratschek, H., Rokne, J.: New computer methods for global optimization. Chichester: Ellis Horwood 1988.

    Google Scholar 

  9. Stahl, V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. PhD thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stahl, V. A sufficient condition for non-overestimation in interval arithmetic. Computing 59, 349–363 (1997). https://doi.org/10.1007/BF02684417

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02684417

Key words

Navigation