Information-Based Nonlinear Approximation: An Average Case Setting

Author Leszek Plaskota

Thumbnail PDF


  • Filesize: 76 kB
  • 1 pages

Document Identifiers

Author Details

Leszek Plaskota

Cite AsGet BibTex

Leszek Plaskota. Information-Based Nonlinear Approximation: An Average Case Setting. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


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.
  • average case setting
  • nonlinear approximation
  • information-based comlexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail