|
This article is cited in 4 scientific papers (total in 4 papers)
On the recursive greedy algorithm
E. D. Livshits
Abstract:
We study the recursive greedy algorithm (RGA) and prove its convergence for any initial function and any dictionary. We get exact (in the power scale) estimates for the rate of convergence of the RGA in the case when the initial function belongs to the class $\mathcal A_1(\mathcal D)$. These estimates are extended to larger classes of initial functions and are used to compare some classes of functions determined by a given dictionary.
Received: 26.11.2004
Citation:
E. D. Livshits, “On the recursive greedy algorithm”, Izv. Math., 70:1 (2006), 87–108
Linking options:
https://www.mathnet.ru/eng/im559https://doi.org/10.1070/IM2006v070n01ABEH002304 https://www.mathnet.ru/eng/im/v70/i1/p95
|
Statistics & downloads: |
Abstract page: | 440 | Russian version PDF: | 246 | English version PDF: | 18 | References: | 64 | First page: | 1 |
|