License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04401.5
URN: urn:nbn:de:0030-drops-1504
Go to the corresponding Portal

Plaskota, Leszek

Information-Based Nonlinear Approximation: An Average Case Setting

04401.PlaskotaLeszek.ExtAbstract.150.pdf (0.07 MB)


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

BibTeX - Entry

  author =	{Plaskota, Leszek},
  title =	{{Information-Based Nonlinear Approximation: An Average Case Setting}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4401},
  editor =	{Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-1504},
  doi =		{10.4230/DagSemProc.04401.5},
  annote =	{Keywords: average case setting , nonlinear approximation , information-based comlexity}

Keywords: average case setting , nonlinear approximation , information-based comlexity
Collection: 04401 - Algorithms and Complexity for Continuous Problems
Issue Date: 2005
Date of publication: 19.04.2005

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI