Greedy algorithm and \(m\)-term trigonometric approximation (Q1281675): Difference between revisions

This paper is devoted to the nonlinear method of approximation of the following type. For the periodic function \(f\) it is taken as an approximant a trigonometric polynomial of the form \( G_m(f):= \sum_{k\in \Lambda} \widehat f (k) \exp{i(k,x)}\), where \(\Lambda\subset \mathbf Z^d\) is a set of cardinality \(m\) containing the indices of the \(m\) biggest (in absolute value) Fourier coefficients \(\widehat f(k)\) of the function \(f\). The author compares the efficiency of this method with the best \(m\)-term trigonometric approximation both for individual function and for some function classes. It turns out that the operator \(G_m\) provides the optimal ( in the sense of order) error of \(m\)-term trigonometric approximation in the \(L_p\)-norm for many classes.