Abstract
We study convergence and rate of convergence of expansions of elements in a Banach space X into series with regard to a given dictionary \(\mathcal{D}\) . For convenience we assume that \(\mathcal{D}\) is symmetric: \(g\in\mathcal{D}\) implies \(-g\in\mathcal{D}\) . The primary goal of this paper is to study representations of an element f∈X by a series
In building such a representation we should construct two sequences: {g j (f)} ∞j=1 and {c j (f)} ∞j=1 . In this paper the construction of {g j (f)} ∞j=1 will be based on ideas used in greedy-type nonlinear approximation. This explains the use of the term greedy expansion. We use a norming functional \(F_{f_{m-1}}\) of a residual f m−1 obtained after m−1 steps of an expansion procedure to select the mth element \(g_{m}(f)\in \mathcal{D}\) from the dictionary. This approach has been used in previous papers on greedy approximation. The greedy expansions in Hilbert spaces are well studied. The corresponding convergence theorems and estimates for the rate of convergence are known. Much less is known about greedy expansions in Banach spaces. The first substantial result on greedy expansions in Banach spaces has been obtained recently by Ganichev and Kalton. They proved a convergence result for the L p , 1<p<∞, spaces. In this paper we find a simple way of selecting coefficients c m (f) that provides convergence of the corresponding greedy expansions in any uniformly smooth Banach space. Moreover, we obtain estimates for the rate of convergence of such greedy expansions for \(f\in A_{1}(\mathcal{D})\) – the closure (in X) of the convex hull of \(\mathcal{D}\) .
Similar content being viewed by others
References
N.K. Bary, Trigonometric Series (Nauka, Moscow, 1961); English transl. in (Pergamon Press, Oxford, 1964).
R.A. DeVore, Nonlinear approximation, Acta Numerica (1998) 51–150.
R.A. DeVore and V.N. Temlyakov, Some remarks on Greedy Algorithms, Adv. Comput. Math. 5 (1996) 173–187.
M. Donahue, L. Gurvits, C. Darken and E. Sontag, Rate of convex approximation in non-Hilbert spaces, Constr. Approx. 13 (1997) 187–220.
V.V. Galatenko and E.D. Livshitz, On convergence of Approximate Weak Greedy Algorithms, East J. Approx. (2003) 43–49.
M. Ganichev and N.J. Kalton, Convergence of the Weak Dual Greedy Algorithm in L p -spaces, J. Approx. Theory 124 (2003) 89–95.
R. Gribonval and M. Nielsen, Approximate Weak Greedy Algorithms, Adv. Comput. Math. 14 (2001) 361–368.
P. Habala, P. Hájek and V. Zizler, Introduction to Banach Spaces [I] (Matfyzpress, Univerzity Karlovy, 1996).
L. Jones, On a conjecture of Huber concerning the convergence of projection pursuit regression, Ann. Statist. 15 (1987) 880–882.
S.V. Konyagin and V.N. Temlyakov, Rate of convergence of Pure Greedy Algorithm, East J. Approx. 5 (1999) 493–499.
J. Lindenstrauss and L. Tzafriri, Classical Banach Spaces II (Springer-Verlag, Berlin, 1979).
E.D. Livshitz, On convergence of greedy algorithms in Banach spaces, Matem. Zametki 73 (2003) 371–389.
V.N. Temlyakov, Weak greedy algorithms, Adv. Comput. Math. 12 (2000) 213–227.
V.N. Temlyakov, Greedy algorithms in Banach spaces, Adv. Comput. Math. 14 (2001) 277–292.
V.N. Temlyakov, A criterion for convergence of Weak Greedy Algorithms, Adv. Comput. Math. 17 (2002) 269–280.
E.D. Livshitz and V.N. Temlyakov, Two lower estimates in greedy approximation, Constr. Approx. 19 (2003) 509–523.
V.N. Temlyakov, Nonlinear methods of approximation, Found. Comput. Math. 3 (2003) 33–107.
V.N. Temlyakov, Greedy expansions in Banach spaces, IMI Preprint Series 6 (2003) 1–21.
Author information
Authors and Affiliations
Additional information
Communicated by Y. Xu
This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-91-J1343.
Rights and permissions
About this article
Cite this article
Temlyakov, V.N. Greedy expansions in Banach spaces. Adv Comput Math 26, 431–449 (2007). https://doi.org/10.1007/s10444-005-7452-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-005-7452-y