Skip to main content
SpringerLink
Log in

On Underestimating in Interval Computations

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A problem of underestimating in interval arithmetic is considered. Assuming some regularity of the dependency between variables, the results of the interval arithmetic operations are underestimated. The proposed underestimates are illustrated using examples. Application possibilities of the proposed underestimates in random interval arithmetic are discussed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Alt and J. L. Lamotte, Experiments on the evaluation of functional ranges using random interval arithmetic, Mathematics and Computers in Simulation, 56 (2001), pp. 17–34.

    Google Scholar 

  2. E. Hansen and G. W. Walster, Global Optimization Using Interval Analysis, Marcel Dekker, New York, 2003.

  3. E. Kaucher, Über Eigenschaften und Anwendungsmöglichkeiten der erweiterten Intervallrechnung des hyperbolische Fastkörpers überRn, Computing, Suppl. 1 (1977), pp. 81–94.

  4. V. Kreinovich, V. M. Nesterov, and N. A. Zheludeva, Interval methods that are guaranteed to underestimate (and the resulting new justification of Kaucher arithmetic), Reliable Computing, 2 (1996), pp. 119–124.

  5. M. Lerch, G. Tischler, J. W. von Gudenberg, W. Hofschuster, and W. Krämer, The interval library filib++ 2.0 – design, features and sample programs, Preprint 2001/4, Universität Wuppertal, 2001.

  6. R. E. Moore, Interval Analysis, Prentice-Hall, 1966.

  7. R. E. Moore, On computing the range of values of a rational function of n variables over a bounded region, Computing, 16 (1976), pp. 1–15.

  8. S. P. Shary, A new technique in systems analysis under interval uncertainty and ambiguity, Reliable Computing, 8 (2002), pp. 321–418.

  9. S. Skelboe, Computation of a rational interval functions, BIT, 14 (1974), pp. 87–95.

  10. A. Törn and A. Žilinskas, Global Optimization, Lecture Notes in Computer Science, 350 (1989), Springer-Verlag, Berlin, pp. 1–252.

  11. A. Žilinskas and J. Žilinskas, On efficiency of tightening bounds in interval global optimization, in PARA’04 State-of-the-Art in Scientific Computing, Lyngby, Denmark, June 20–23, 2004, Proceedings, J. Dongarra, K. Madsen, and J. Wasniewski (eds), Lecture Notes in Computer Science, Springer, 2005, accepted.

  12. J. Žilinskas and I. D. L. Bogle, Evaluation ranges of functions using balanced random interval arithmetic, Informatica, 14 (2003), pp. 403–416.

  13. J. Žilinskas and I. D. L. Bogle, Balanced random interval arithmetic, Computers and Chemical Engineering, 28 (2004), pp. 839–851.

  14. J. Žilinskas, Comparison of packages for interval arithmetic, Informatica, 16 (2005), pp. 145–154.

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Akademijos 4, Vilnius, LT-08663, Lithuania

    A. Žilinskas & J. Žilinskas

Authors
  1. A. Žilinskas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Žilinskas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. Žilinskas or J. Žilinskas.

Additional information

AMS subject classification (2000)

65G30

Rights and permissions

Reprints and permissions

About this article

Cite this article

Žilinskas, A., Žilinskas, J. On Underestimating in Interval Computations. Bit Numer Math 45, 415–427 (2005). https://doi.org/10.1007/s10543-005-7144-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10543-005-7144-5

Key words

Search

Navigation