Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8898470 | Journal of Approximation Theory | 2018 | 15 Pages |
Abstract
We generalize the well-known greedy approximation algorithm, by allowing gaps in the approximating sequence. We give examples of bases which are “quasi-greedy with gaps,” in spite of failing to be quasi-greedy in the usual sense. However, we also show that for some classical bases (such as the normalized Haar basis in L1, and the trigonometric basis in Lp for pâ 2), the greedy algorithm may diverge, even if gaps are introduced into the approximating sequence.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
T. Oikhberg,