Abstract
Let f(x) be a rational function and let F(X) be an interval extension of f(x). When we evaluate F(X) using interval arithmetic, we obtain an interval which bounds the range of f(x) for all x in the interval X. In some cases, the lower or upper bound (or both) may be sharp. We show that we can determine whether an endpoint is sharp or not merely by keeping track of which endpoints of X are used in each step of the evaluation of F(X). We show that in certain cases, this procedure can prove that f(x) is monotonic in the interval X.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hansen, E.R. Sharpness in Interval Computations. Reliable Computing 3, 17–29 (1997). https://doi.org/10.1023/A:1009917818868
Issue Date:
DOI: https://doi.org/10.1023/A:1009917818868