Advertisement

On the optimality of inclusion algorithms

  • Henryk Kołacz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 212)

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.

Keywords

Complete Lattice Interval Analysis Information Operator Nonnegative Real Number Range Approximation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Kulisch, U.W. and Miranker, W.L.: Computer arithmetic in theory and practice, Academic Press, New York, 1981.Google Scholar
  2. [2]
    Moore, R.E.: Interval analysis, Printice-Hall, Englewood Cliffs, New York, 1966.Google Scholar
  3. [3]
    Moore, R.E.: Methods and applications of interval analysis, SIAM, Philadelphia, 1979.Google Scholar
  4. [4]
    Ratschek, H. and Rokne, J.: Computer methods for the range of functions, Ellis Horwood Limited, 1984.Google Scholar
  5. [5]
    Ratschek, H.: Optimality of the centered form for polynomials, Journal of Approximation Theory, 32, pp. 151–159, 1981.CrossRefGoogle Scholar
  6. [6]
    Ratschek, H.: Optimal approximations in interval analysis, in: Interval Mathematics, ed. K. Nickel, Academic Press, pp. 181–202, 1980.Google Scholar
  7. [7]
    Traub, J.F. and Woźniakowski, H.: A general theory of optimal algorithms, Academic Press, New York, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Henryk Kołacz
    • 1
  1. 1.Institute of MathematicsTechnical University of PoznańPoznańPoland

Personalised recommendations