arXiv · 1207.0946
Lebesgue type inequalities for quasi-greedy bases
Abstract
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the quasi-greedy constant of the basis. If the basis is democratic this function is bounded by C logN. We show with two examples that this bound is attained for quasi-greedy democratic bases.
Explore related subjects
Keep this discovery
Gustavo Garrigós, Eugenio Hernández, Timur Oikhberg. 2012-07-04. Lebesgue type inequalities for quasi-greedy bases. https://arxiv.org/abs/1207.0946
Cite the original work for its findings. Save a collection to share your selection of sources.