On Lebesgue-type inequalities for greedy approximation
- 31 August 2007
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 147 (2) , 185-195
- https://doi.org/10.1016/j.jat.2007.01.004
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Nonlinear Methods of ApproximationFoundations of Computational Mathematics, 2003
- Greedy Approximation with Regard to Bases and General Minimal SystemsPublished by Defense Technical Information Center (DTIC) ,2002
- Weak greedy algorithms[*]This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014‐96‐1‐1003.Advances in Computational Mathematics, 2000
- Greedy Algorithms andM-Term Approximation with Regard to Redundant DictionariesJournal of Approximation Theory, 1999
- Some remarks on greedy algorithmsAdvances in Computational Mathematics, 1996