On the optimality of inclusion algorithms
In this paper a general concept of inclusion algorithm is introduced. Any inclusion algorithm provides a set that includes the solution of a given problem. Inclusion algorithms are studied with respect to the information used by them.
Some examples illustrate the presented concepts and results.
KeywordsComplete Lattice Interval Analysis Information Operator Nonnegative Real Number Range Approximation
Unable to display preview. Download preview PDF.
- Kulisch, U.W. and Miranker, W.L.: Computer arithmetic in theory and practice, Academic Press, New York, 1981.Google Scholar
- Moore, R.E.: Interval analysis, Printice-Hall, Englewood Cliffs, New York, 1966.Google Scholar
- Moore, R.E.: Methods and applications of interval analysis, SIAM, Philadelphia, 1979.Google Scholar
- Ratschek, H. and Rokne, J.: Computer methods for the range of functions, Ellis Horwood Limited, 1984.Google Scholar
- Ratschek, H.: Optimal approximations in interval analysis, in: Interval Mathematics, ed. K. Nickel, Academic Press, pp. 181–202, 1980.Google Scholar
- Traub, J.F. and Woźniakowski, H.: A general theory of optimal algorithms, Academic Press, New York, 1980.Google Scholar