Lebesgue-type inequalities for quasi-greedy bases

From MaRDI portal
Publication:387546

DOI10.1007/S00365-013-9209-ZzbMATH Open1284.41023arXiv1207.0946OpenAlexW1967146357MaRDI QIDQ387546FDOQ387546


Authors: Gustavo Garrigós, E. Hernández, T. Oikhberg Edit this on Wikidata


Publication date: 23 December 2013

Published in: Constructive Approximation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1207.0946




Recommendations




Cites Work


Cited In (31)





This page was built for publication: Lebesgue-type inequalities for quasi-greedy bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387546)