Information-based nonlinear approximation: an average case setting

  • Authors:

  • Mark Kon;Leszek Plaskota

  • Affiliations:

  • Department of Mathematics and Statistics, Boston University, 111 Cummington Street, Boston, MA;Department of Mathematics, Informatics and Mechanics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland

  • Venue:
  • Journal of Complexity
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nonlinear approximation (NA) has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partial information, e.g., function values at some points, and we are interested in the average case error and complexity of NA. We show that the problem can be essentially decomposed in two independent problems related to average case nonlinear (restricted) approximation from complete information, and to average case unrestricted approximation from partial information. The results are then applied to average case piecewise polynomial approximation on C([0, 1]) based on function values with respect to r-fold Wiener measure. In this case, to approximate with error ε it is necessary and sufficient to know the function values at Θ ((ε-1In1/2(1/ε))1/(r+1/2)) equidistant points and use Θ (ε-1/(r+1/2)) adaptively chosen break points in piecewise polynomial approximation.