On convergence of weak greedy algorithms (Q2783079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convergence of weak greedy algorithms |
scientific article; zbMATH DE number 1729328
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence of weak greedy algorithms |
scientific article; zbMATH DE number 1729328 |
Statements
8 January 2003
0 references
convergence
0 references
weak greedy algorithm
0 references
pure greedy algorithm
0 references
Hilbert space
0 references
dictionary
0 references
0.9705852
0 references
0.95408773
0 references
0.9430205
0 references
0 references
0.9171457
0 references
0.91430795
0 references
0.9140728
0 references
0.90931934
0 references
0.90909517
0 references
On convergence of weak greedy algorithms (English)
0 references
This paper deals with the weak greedy algorithm (WGA) introduced by \textit{V. N. Temlyakov} [Adv. Comput. Math. 12, No. 2-3, 213-227 (2000; Zbl 0964.65009)]. It is a modification of a pure greedy algorithm (PGA). At the \(m\)-th step of the WGA an approximating element from a given dictionary is chosen using a weaker condition than the one in a PGA. It is demonsrated that the WGA converges for all elements of any separable Hilbert space and any dictionary.NEWLINENEWLINEFor the entire collection see [Zbl 0981.00017].
0 references
