Greedy Algorithms andM-Term Approximatio
โ
V.N. Temlyakov
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 198 KB
We study the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and we prove a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is near best in the sense of power decay of error of approximation. We