Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness

From MaRDI portal
Publication:2963673

DOI10.1070/SM2015V206N11ABEH004507zbMATH Open1362.41009arXiv1412.8647MaRDI QIDQ2963673FDOQ2963673


Authors: V. N. Temlyakov Edit this on Wikidata


Publication date: 21 February 2017

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Abstract: Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s -- 1990s, and recent results on greedy approximation to obtain sharp estimates for best m-term approximation with respect to the trigonometric system. We give some observations on numerical integration and approximate recovery of functions with mixed smoothness. We prove lower bounds, which show that one cannot improve accuracy of sparse grids methods with asymp2nnd1 points in the grid by adding 2n arbitrary points. In case of numerical integration these lower bounds provide best known lower bounds for optimal cubature formulas and for sparse grids based cubature formulas.


Full work available at URL: https://arxiv.org/abs/1412.8647




Recommendations





Cited In (28)





This page was built for publication: Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963673)