SCOPUS 정보 검색 플랫폼

Volumn 14, Issue 3, 2001, Pages 277-292

Greedy algorithms in Banach spaces

Author keywords

Banach space; Best approximation; Convergence; Greedy algorithm; Nonlinear approximation; Redundant systems

Indexed keywords

EID: 0035634238 PISSN: 10197168 EISSN: None Source Type: Journal
DOI: 10.1023/A:1016657209416 Document Type: Article

Times cited : (61)

References (4)

1
- 0031531584
- Rate of convex approximation in non-Hilbert spaces
- M. Donahue, L. Gurvits, C. Darken and E. Sontag, Rate of convex approximation in non-Hilbert spaces, Constructive Approx. 13 (1997) 187-220.
- (1997) Constructive Approx. , vol.13 , pp. 187-220
- Donahue, M.¹ Gurvits, L.² Darken, C.³ Sontag, E.⁴

2
- 0039439070
- Some remarks on greedy algorithms
- R.A. DeVore and V.N. Temlyakov, Some remarks on greedy algorithms, Adv. Comput. Math. 5 (1996) 173-187.
- (1996) Adv. Comput. Math. , vol.5 , pp. 173-187
- DeVore, R.A.¹ Temlyakov, V.N.²

3
- 0003568115
- Springer, Berlin
- J. Lindenstrauss and L. Tzafriri, Classical Banach Spaces II (Springer, Berlin, 1979).
- (1979) Classical Banach Spaces , vol.2
- Lindenstrauss, J.¹ Tzafriri, L.²

4
- 22844454658
- Weak greedy algorithms
- V.N. Temlyakov, Weak greedy algorithms, Adv. Comput. Math. 12 (2000) 213-227.
- (2000) Adv. Comput. Math. , vol.12 , pp. 213-227
- Temlyakov, V.N.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.