Lebesgue-Type inequalities for quasi-greedy bases
classification
🧮 math.FA
keywords
quasi-greedybasesconstanterroralgorithmapproximationbanachbasis
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.