English

Lebesgue-Type inequalities for quasi-greedy bases

Functional Analysis 2011-11-17 v2

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.

Keywords

Cite

@article{arxiv.1111.0460,
  title  = {Lebesgue-Type inequalities for quasi-greedy bases},
  author = {Eugenio Hernández},
  journal= {arXiv preprint arXiv:1111.0460},
  year   = {2011}
}

Comments

8 pages