Advertisement

Computing under Interval Uncertainty: General Algorithms

  • Hung T. Nguyen
  • Vladik Kreinovich
  • Berlin Wu
  • Gang Xiang
Part of the Studies in Computational Intelligence book series (SCI, volume 393)

Abstract

Need for interval computations. In many application areas, it is sufficient to have an approximate estimate of y – e.g., an estimate obtained from linearization. However, in some applications, it is important to guarantee that the (unknown) actual value y of a certain quantity does not exceed a certain threshold y0. The only way to guarantee this is to have an interval Y = [Y, \(\overline{Y}\) ] which is guaranteed to contain y (i.e., for which yY ) and for which \(\overline{Y}\)y0.

Keywords

General Algorithm Remainder Term Interval Arithmetic Interval Uncertainty Interval Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hung T. Nguyen
    • Vladik Kreinovich
      • Berlin Wu
        • Gang Xiang

          There are no affiliations available

          Personalised recommendations