Lebesgue inequalities for the greedy algorithm in general bases
Functional Analysis
2016-06-22 v1
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.
Keywords
Cite
@article{arxiv.1606.06721,
title = {Lebesgue inequalities for the greedy algorithm in general bases},
author = {Pablo M. Berná and Gustavo Garrigós and Óscar Blasco},
journal= {arXiv preprint arXiv:1606.06721},
year = {2016}
}
Comments
21 pages