Information-Based Nonlinear Approximation: An Average Case Setting

Plaskota, Leszek

doi:10.4230/DagSemProc.04401.5

Document

Information-Based Nonlinear Approximation: An Average Case Setting

Author Leszek Plaskota

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 4401
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2005-04-19

PDF

File

PDF

DagSemProc.04401.5.pdf

Filesize: 76 kB
1 pages

Document Identifiers

DOI: 10.4230/DagSemProc.04401.5
URN: urn:nbn:de:0030-drops-1504

Subject Classification

Keywords

average case setting
nonlinear approximation
information-based comlexity

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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) https://doi.org/10.4230/DagSemProc.04401.5

Author Details

Leszek Plaskota

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail