Skip to main content
SpringerLink
Log in

Computation of rational interval functions

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper presents a general algorithm for computing interval expressions. The strategy is characterized by a subdivision of the argument intervals of the expression and a recomputation of the expression with these new intervals. The precision of the result is limited only by the actual computer.

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. E. Moore,Interval Analysis, p. 11, Prentice-Hall, 1966.

  2. E. R. Hansen,Topics in interval Analysis, p. 103, Oxford University Press, 1969.

  3. K. Nickel and K. Ritter,Termination criterion and numerical convergence, SIAM J. Numer. Anal. 9 (1972), 277–283.

    Google Scholar 

  4. N. Apostolatos et al.,The algorithmic language Triplex-Algol 60, Numerische Mathematik 11 (1968), 175–180.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Numerisk Institut Danmarks Tekniske Højskole, DK-2800, Lyngby, Denmark

    Stig Skelboe

Authors
  1. Stig Skelboe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skelboe, S. Computation of rational interval functions. BIT 14, 87–95 (1974). https://doi.org/10.1007/BF01933121

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation