Abstract
Interval arithmetic can be used to enclose the range of a real function over a domain. However, due to some weak properties of interval arithmetic, a computed interval can be much larger than the exact range. This phenomenon is called dependency problem. In this paper, Horner's rule for polynomial interval evaluation is revisited. We introduce a new factorization scheme based on well-known symbolic identities in order to handle the dependency problem of interval arithmetic. The experimental results show an improvement of 25% of the width of computed intervals with respect to Horner's rule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 14, 2001; revised March 27, 2002 Published online: July 8, 2002
Rights and permissions
About this article
Cite this article
Ceberio, M., Granvilliers, L. Horner's Rule for Interval Evaluation Revisited. Computing 69, 51–81 (2002). https://doi.org/10.1007/s00607-002-1448-y
Issue Date:
DOI: https://doi.org/10.1007/s00607-002-1448-y