Abstract
We consider some theoretical greedy algorithms for approximation in Banach spaces with respect to a general dictionary. We prove convergence of the algorithms for Banach spaces which satisfy certain smoothness assumptions. We compare the algorithms and their rates of convergence when the Banach space is Lp (double struck T signd) (1 < p < ∞) and the dictionary is the trigonometric system.
Original language | English (US) |
---|---|
Pages (from-to) | 489-505 |
Number of pages | 17 |
Journal | Journal of Fourier Analysis and Applications |
Volume | 8 |
Issue number | 5 |
DOIs | |
State | Published - 2002 |
Externally published | Yes |
Keywords
- Banach spaces
- Greedy algorithms
- Trigonometric approximation
ASJC Scopus subject areas
- Analysis
- General Mathematics
- Applied Mathematics