Abstract
In many interval computation methods, if we cannot guarantee a solution within a given interval, it often makes sense to "inflate" this interval a little bit. There exist many different "inflation" methods. The authors of PASCAL-XSC, after empirically comparing the behavior of different inflation methods, decided to implement the formula [x-,x+]ε = [(1 + ε)x- - ε · x+, (1 + ε)x+ - ε · x-]. A natural question is: Is this choice really optimal (in some reasonable sense), or is it only an empirical approximation to the truly optimal choice?
In this paper, we show that this empirical choice can be theoretically justified. Namely, we will give two justifications:
First, the inflation method used in PASCAL-XSC is the only inflation that is invariant w.r.t. some reasonable symmetries; and
Second, that this inflation method is optimal in some reasonable sense.
Similar content being viewed by others
References
Hammer, R., Hocks, M., Kulisch, U., and Ratz, D.: Numerical Toolbox for Verified Computing. 1. Basic Numerical Problems, Springer Verlag, Heidelberg, N.Y., 1993.
Mayer, G.: A Unified Approach to Enclosure Methods for Eigenpairs, ZAMM 74(2) (1994), pp. 115–128.
Mayer, G.: Epsilon-Inflation in Verification Algorithms, Journal of Computational and Applied Mathematics 60 (1995), pp. 147–169.
Starks, S.: An Interval Approach to Congestion Control in Computer Networks, in: Extended Abstracts of APIC'95: International Workshop on Applications of Interval Computations, El Paso, TX, Febr. 23–25, 1995, Reliable Computing (1995), Supplement, pp. 203–206.
Wu, Kung Chris: Interval Methods in Mobile Robot Control, in: Extended Abstracts of APIC'95: International Workshop on Applications of Interval Computations, El Paso, TX, Febr. 23–25, 1995, Reliable Computing (1995), Supplement, pp. 224–226.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kreinovich, V., Starks, S. & Mayer, G. On a Theoretical Justification of the Choice of Epsilon-Inflation in PASCAL-XSC. Reliable Computing 3, 437–445 (1997). https://doi.org/10.1023/A:1009905822286
Issue Date:
DOI: https://doi.org/10.1023/A:1009905822286