Advertisement

Recovery of Functions from Their Values

Chapter
  • 57 Downloads
Part of the Theory and Decision Library book series (TDLB, volume 21)

Abstract

In this chapter, we deal with the problem of approximating functions on the basis of their values at a finite number of points. We derive optimal deterministic nonadaptive algorithms and show that adaption does not help improve the result guaranteed in the dass of all nonadaptive algorithms. We also obtain a sequentially optimal algorithm for functions of one variable.

Keywords

Optimal Algorithm Adaptive Algorithm Recursion Equation Optimal Covering Optimal Recovery 
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.

Copyright information

© Springer Science+Business Media Dordrecht 1992

Authors and Affiliations

  1. 1.Moscow State UniversityRussia

Personalised recommendations