V. N. Temlyakov, “Greedy Algorithm and m-Term Trigonometric Approximation,” Constructive Approximation, Vol. 14, No. 4, 1998, pp. 569-587. doi:10.1007/s003659900090
has been cited by the following article:
TITLE: The Best m-Term One-Sided Approximation of Besov Classes by the Trigonometric Polynomials
AUTHORS: Rensuo Li, Yongping Liu
KEYWORDS: Besov Classes; m-Term Approximation; One-Sided Approximation; Trigonometric Polynomial; Greedy Algorithm
JOURNAL NAME: Advances in Pure Mathematics, Vol.2 No.3, May 29, 2012
ABSTRACT: In this paper, we continue studying the so called best m-term one-sided approximation and Greedy-liked one-sided ap- proximation by the trigonometric polynomials. The asymptotic estimations of the best m-terms one-sided approximation by the trigonometric polynomials on some classes of Besov spaces in the metricLp(Td(1≤p≤∞ are given.