Lebesgue-type inequalities for quasi-greedy bases

From MaRDI portal
(Redirected from Publication:387546)




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.




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)