Plaskota, Leszek
Information-Based Nonlinear Approximation: An Average Case Setting
Abstract
Nonlinear approximation has usually been studied
under deterministic assumption and complete
information about the underlying functions.
We assume only partial information and we are
interested in the average case error and
complexity of approximation. It turns out that
the problem can be essentially split into two
independent problems related to average case
nonlinear (restricted) approximation from
complete information, and average case
unrestricted approximation from partial
information. The results are then applied to
average case piecewise polynomial approximation,
and to average case approximation of real
sequences.
BibTeX - Entry
@InProceedings{plaskota:DSP:2005:150,
author = {Leszek Plaskota},
title = {Information-Based Nonlinear Approximation: An Average Case Setting},
booktitle = {Algorithms and Complexity for Continuous Problems},
year = {2005},
editor = {Thomas M{\"u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
number = {04401},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2005/150},
annote = {Keywords: average case setting , nonlinear approximation , information-based comlexity}
}
|
Keywords: |
|
average case setting , nonlinear approximation , information-based comlexity |
|
Seminar: |
|
04401 - Algorithms and Complexity for Continuous Problems
|
|
Issue date: |
|
2005 |
|
Date of publication: |
|
2005 |
2005
