Characterization of greedy bases in Banach spaces
DOI10.1016/J.JAT.2016.11.008zbMATH Open1369.46014arXiv1604.07260OpenAlexW2963282618MaRDI QIDQ505893FDOQ505893
Authors: Pablo M. Berná, Oscar Blasco
Publication date: 26 January 2017
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07260
Recommendations
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Cites Work
Cited In (17)
- A remark on approximation with polynomials and greedy bases
- The best \(m\)-term approximation with respect to polynomials with constant coefficients
- The weighted property (A) and the greedy algorithm
- On left democracy function
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- Weak forms of unconditionality of bases in greedy approximation
- On consecutive greedy and other greedy-like type of bases
- Renorming spaces with greedy bases
- A note on partially-greedy bases in quasi-Banach spaces
- On some characterizations of greedy-type bases
- Characterization of 1-greedy bases
- Elton's near unconditionality of bases as a threshold-free form of greediness
- Characterization of 1-almost greedy bases
- Extensions and new characterizations of some greedy-type bases
- Characterizations of almost greedy and partially greedy bases
- Characterization of 1-quasi-greedy bases
- Greedy algorithms for reduced bases in Banach spaces
This page was built for publication: Characterization of greedy bases in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505893)