Abstract
The article extends upon previous work by Temlyakov, Konyagin, and Wojtaszczyk on comparing the error of certain greedy algorithms with that of best m-term approximation with respect to a general biorthogonal system in a Banach space X. We consider both necessary and sufficient conditions which cover most of the special cases previously considered. Some new results concerning the Haar system in L1, L∞, and BMO are also included.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cohen, A., Dahmen, W., Daubechies, I., and DeVore, R. (1999). Tree approximation and optimal encoding, IMI Research Report 99:09, University of South Carolina.
DeVore, R., Petrushev, P., and Yu, X.M. (1992). Wavelet approximation in the spaceC, inProgress in Approximation Theory, Gonchar, A.A. and Saff, E.B., Eds., Springer-Verlag, New York, 261–283.
DeVore, R. and Temlyakov, V.N. (1996). Some remarks on greedy algorithms,Advances in Computational Mathematics,5, 173–187.
DeVore, R. and Temlyakov, V.N. (1997). Nonlinear approximation in finite-dimensional spaces,J. Complexity,13, 489–508.
Guerre-Delabrière, S. (1992).Classical Sequences in Banach Spaces, Marcel-Dekker, New York.
Kashin, B.S. and Saakyan, A.A. (1989). Orthogonal series,Transl. Math. Monographs,75, AMS, Providence.
Konyagin, S.V. and Temlyakov, V.N. (1999). A remark on Greedy approximation in Banach spaces,East J. on Approx.,5, 1–19.
Oswald, P. (1999). Greedy algorithms and bestm-term approximation with respect to minimal systems, Tech. Rep. BL99.01597, Bell Laboratories, Lucent Technologies, September, 20 p.
Temlyakov, V.N. (1998). Nonlinearm-term approximation with regard to the multivariate Haar system.East J. on Approx.,4(1), 87–106.
Temlyakov, V.N. (1998). The bestm-term approximation and greedy algorithms,Advances in Computational Mathematics,8, 249–265.
Temlyakov, V.N. (1998). Greedy algorithm andm-term trigonometric approximation,Constructive Approximation,14, 569–587.
Temlyakov, V.N. (1999). Greedy algorithms andm-term approximation with regard to redundant dictionaries,J. Approx. Theory,98, 117–145.
Temlyakov, V.N. (2000). Weak greedy algorithms,Advances in Comp. Math. 12, 213–227.
Wojtaszczyk, P. (1982). The Franklin system is an unconditional basis inH 1,Arkiv. Mat.,20, 293–300.
Wojtaszczyk, P. (2000), Greedy algorithms for general systems,J. Approx. Th.,107, 293–314.
Author information
Authors and Affiliations
Additional information
Communicated by Hans G. Feichtinger
Rights and permissions
About this article
Cite this article
Oswald, P. Greedy algorithms and bestm-term approximation with respect to biorthogonal systems. The Journal of Fourier Analysis and Applications 7, 325–341 (2001). https://doi.org/10.1007/BF02514500
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02514500