arXiv · 1606.06721
Lebesgue inequalities for the greedy algorithm in general bases
Abstract
We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly improve various estimates appearing earlier in the literature.
Explore related subjects
Keep this discovery
Pablo M. Berná, Gustavo Garrigós, Óscar Blasco. 2016-06-21. Lebesgue inequalities for the greedy algorithm in general bases. https://arxiv.org/abs/1606.06721
Cite the original work for its findings. Save a collection to share your selection of sources.