Rate of Convergence of Greedy Algorithms
Matematičeskie zametki, Tome 76 (2004) no. 4, pp. 628-632
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{MZM_2004_76_4_a14,
author = {A. V. Sil'nichenko},
title = {Rate of {Convergence} of {Greedy} {Algorithms}},
journal = {Matemati\v{c}eskie zametki},
pages = {628--632},
year = {2004},
volume = {76},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a14/}
}
A. V. Sil'nichenko. Rate of Convergence of Greedy Algorithms. Matematičeskie zametki, Tome 76 (2004) no. 4, pp. 628-632. http://geodesic.mathdoc.fr/item/MZM_2004_76_4_a14/
[1] DeVore R. A., Temlyakov V. N., Adv. Comput. Math., 5 (1996), 173–187 | DOI | MR | Zbl
[2] Konyagin S. V., Temlyakov V. N., East J. Approx., 5:4 (1999), 493–499 | MR
[3] Livshitz E. D., Temlyakov V. N., Constructive Approx., 19:4 (2003), 509–523 | DOI | MR | Zbl
[4] Temlyakov V. N., Greedy expansions in Banach spaces, Research report 2003:06, Dept. Math. Univ. South Carolina, Columbia, SC, 2003