Greedy approximation for biorthogonal systems in quasi-Banach spaces
Preprint
Abstract
The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic point of view. We revisit the concepts of greedy, quasi-greedy, and almost greedy bases in this comprehensive framework and provide the (nontrivial) extensions of the corresponding characterizations of those types of bases. As a by-product of our work, new properties arise, and the relations amongst them are carefully discussed.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Basis Properties of the Haar System in Limiting Besov Spaces2021
- Lebesgue-Type Inequalities for Quasi-greedy BasesConstructive Approximation, 2013
- Greedy Bases for Besov SpacesConstructive Approximation, 2010
- The Thresholding Greedy Algorithm, Greedy Bases, and DualityConstructive Approximation, 2003
- Convergence of Some Greedy Algorithms in Banach SpacesJournal of Fourier Analysis and Applications, 2002
- On Approximate ℓ 1 Systems in Banach SpacesJournal of Approximation Theory, 2002
- Greedy Algorithm for General Biorthogonal SystemsJournal of Approximation Theory, 2000
- Unconditional Bases Are Optimal Bases for Data Compression and for Statistical EstimationApplied and Computational Harmonic Analysis, 1993
- Weighted Lorentz Spaces and the Hardy OperatorJournal of Functional Analysis, 1993
- Uniqueness of unconditional bases in quasi-banach spaces with applications to Hardy spacesIsrael Journal of Mathematics, 1990