Constructive sparse trigonometric approximation for functions with small mixed smoothness

2015/03/01 by Vladimir Temlyakov, Temlyakov, V. N.
Mathematics · Computer Science · #Mathematical Approximation and Integration #Differential Equations and Boundary Problems #Advanced Computational Techniques in Science and Engineering

paper · pdf · doi:10.48550/arxiv.1503.00282

Abstract

The paper gives a constructive method, based on greedy algorithms, that provides for the classes of functions with small mixed smoothness the best possible in the sense of order approximation error for the m-term approximation with respect to the trigonometric system.

Related

• High-dimensional sparse trigonometric approximation in the uniform norm and consequences for sampling recovery
• Sparse approximation by greedy algorithms
• Algorithms for pointwise and piecewise polynomial approximations to the trigonometric functions
• Approximation of functions with small mixed smoothness in the uniform norm
• Approximation, regularization and smoothing of trigonometric splines