A lower bound for range enclosure in interval arithmetic

Abstract Including the range of a rational function over an interval is an important problem in numerical computation. A direct interval arithmetic evaluation of a formula for the function yields in general a superset with an error linear in the width of the interval. Special formulas like the centered forms yield a better approximation with a quadratic error. Alefeld posed the question whether in general there exists a formula whose interval arithmetic evaluation gives an approximation of better than quadratic order. In this paper we show that the answer to this question is negative if in the interval arithmetic evaluation of a formula only the basic four interval operations +,−,·,/ are used.

[1]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[2]  Götz Alefeld,et al.  The basic properties of interval arithmetic, its software realizations and some applications , 1998 .

[3]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[4]  Jon G. Rokne,et al.  Computer Methods for the Range of Functions , 1984 .

[5]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[6]  Eldon Hansen,et al.  Topics in Interval Analysis , 1969 .

[7]  G. Alefeld,et al.  Enclosure Methods , 1990, Computer Arithmetic and Self-Validating Numerical Methods.

[8]  Christian P. Ullrich,et al.  Computer Arithmetic and Self-Validating Numerical Methods , 1990, Notes and reports in mathematics in science and engineering.

[9]  Vladik Kreinovich,et al.  On hardware support for interval computations and for soft computing: theorems , 1997, IEEE Trans. Fuzzy Syst..