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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Communicated by Ronald A. DeVore
Rights and permissions
About this article
Cite this article
Dilworth, S., Kalton, N., Kutzarova, D. et al. The Thresholding Greedy Algorithm, Greedy Bases, and Duality. Constr. Approx. 19, 575–597 (2003). https://doi.org/10.1007/s00365-002-0525-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00365-002-0525-y