The thresholding greedy algorithm, greedy bases and duality
A 2001 Preprint by S. Dilworth, N. Kalton, D. Kutzarova, and V. Temlyakov
- 2001:23
Some new conditions that arise naturally in the study of the Thresholding Greedy Algorithm are introduced for bases of Banach spaces. We relate these conditions to best n-term approximation and we study their duality theory. In particular, we obtain a complete duality theory for greedy bases.
