Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4604930 | Applied and Computational Harmonic Analysis | 2016 | 15 Pages |
Abstract
We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Guergana Petrova,