Eugenio Hernández
Published 2011-11-02, updated 2011-11-16Version 2
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.
Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
Lebesgue type inequalities for quasi-greedy bases
Quasi-greedy bases in the spaces $\ell_p$ ($0<p<1$) are democratic
![QR code for arXiv:1111.0460 [math.FA]](http://oss.arxitics.com/images/favicon.svg)