Author:
Nelson J. L.,Temlyakov V. N.
Subject
Mathematics (miscellaneous)
Reference11 articles.
1. R. A. DeVore and V. N. Temlyakov, “Some Remarks on Greedy Algorithms,” Adv. Comput. Math. 5(2–3), 173–187 (1996).
2. S. V. Konyagin and V. N. Temlyakov, “Rate of Convergence of Pure Greedy Algorithm,” East J. Approx. 5(4), 493–499 (1999).
3. E. D. Livshitz, “Lower Bounds for the Rate of Convergence of Greedy Algorithms,” Izv. Ross. Akad. Nauk, Ser. Mat. 73(6), 125–144 (2009) [Izv. Math. 73, 1197–1215 (2009)].
4. E. D. Livshitz and V. N. Temlyakov, “Two Lower Estimates in Greedy Approximation,” Constr. Approx. 19(4), 509–523 (2003).
5. A. V. Sil’nichenko, “Rate of Convergence of Greedy Algorithms,” Mat. Zametki 76(4), 628–632 (2004) [Math. Notes 76, 582–586 (2004)].
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献