arXiv · 1111.0460
Lebesgue-Type inequalities for quasi-greedy bases
Abstract
We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the quasi-greedy constant of the basis.
Explore related subjects
Keep this discovery
Eugenio Hernández. 2011-11-02. Lebesgue-Type inequalities for quasi-greedy bases. https://arxiv.org/abs/1111.0460
Cite the original work for its findings. Save a collection to share your selection of sources.