Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Kulisch, U.W. and Miranker, W.L.: Computer arithmetic in theory and practice, Academic Press, New York, 1981.
Moore, R.E.: Interval analysis, Printice-Hall, Englewood Cliffs, New York, 1966.
Moore, R.E.: Methods and applications of interval analysis, SIAM, Philadelphia, 1979.
Ratschek, H. and Rokne, J.: Computer methods for the range of functions, Ellis Horwood Limited, 1984.
Ratschek, H.: Optimality of the centered form for polynomials, Journal of Approximation Theory, 32, pp. 151–159, 1981.
Ratschek, H.: Optimal approximations in interval analysis, in: Interval Mathematics, ed. K. Nickel, Academic Press, pp. 181–202, 1980.
Traub, J.F. and Woźniakowski, H.: A general theory of optimal algorithms, Academic Press, New York, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kołacz, H. (1986). On the optimality of inclusion algorithms. In: Nickel, K. (eds) Interval Mathematics 1985. IMath 1985. Lecture Notes in Computer Science, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16437-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-16437-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16437-1
Online ISBN: 978-3-540-39779-3
eBook Packages: Springer Book Archive