Greedy algorithm and m-term trigonometric approximation

Constructive Approximation

Volumn 14, Issue 4, 1998, Pages 569-587

  Temlyakov, V N ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Asymptotic estimates; Besov classes; Existence theorem; Greedy algorithm; Nonlinear approximation

Indexed keywords

EID: 0032334353     PISSN: 01764276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003659900090     Document Type: Article

References (6)

1. [B] E. S. BELINSKII (1988): Approximation by a "floating" system of exponential of classes of smooth periodic functions. Math. USSR-Sb., 60:19-27.
2. R. A. DEVORE, V. N. TEMLYAKOV (1995): Nonlinear approximation by trigonometric sums. J. Fourier Anal. Appl., 2(1):29-48.
3. R. A. DEVORE, V. N. TEMLYAKOV (1995): Some remarks on Greedy Algorithms. Adv. Comput. Math., 5:173-187.
4. [N] S. N. NIKOLŚKII (1969): Approximation of Functions of Several Variables and Embedding Theorems. New York: Springer-Verlag. English translation published by Nauka, Moscow.
5. [T] V. N. TEMLYAKOV (1993): Approximation of Periodic Functions. New York: Nova Science.
6. [Z] A. ZYGMUND (1959): Trigonometric Series, vols. I, II. Cambridge: Cambridge University Press.