| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4608446 | Journal of Approximation Theory | 2006 | 22 Pages |
Abstract
A basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a constant C depending only on X, the best m-term approximation for each element of the space. It is known that the Haar (or good wavelet) basis is a greedy basis in Lp(0,1) for 1
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
