| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4607397 | Journal of Approximation Theory | 2012 | 14 Pages |
Abstract
In this article, we continue to study the performance of Greedy Algorithms. We show that the Orthogonal Greedy Algorithm (Orthogonal Matching Pursuit) provides an almost optimal approximation on the first [μ−1/20][μ−1/20] steps for μμ-coherent dictionaries.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
E.D. Livshitz,