Computing an enclosure for the range of a rational function over an interval is one of the main goals of interval analysis. One way to obtain such an enclosure is to use interval arithmetic evaluation of a formula for the function. Often one would like to check how close the overestimation is to the correct range. Kreinovich, Nesterov, and Zheludeva (Reliable Computing 2(2) (1996)) suggested a new kind of twin arithmetic which produces a twin of intervals at the same time: the usual enclosure, i.e., an interval which is an overestimation for the range, and an interval which is contained in the range, i.e. an interval which is an underestimation for the range. We show in this paper that in certain cases the computed inner interval is much smaller than the correct range. For example, if the function has the same value in the two endpoints of the interval then the inner interval is either empty or contains only one point.
Reliable Computing – Springer Journals
Published: Oct 3, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud