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

DOI10.1070/SM2015V206N11ABEH004507MaRDI QIDQ2963673zbMATH OpenFDO

Authors V. N. Temlyakov

Publication date 21 February 2017

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

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

zbMATH Keywords

sparse approximationnonlinear approximationtrigonometric systemconstructive methods

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35)

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 $asymp{2}^n{n}^{d-1}$ points in the grid by adding $2^n$ 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.

Recommendations

• Constructive sparse trigonometric approximation for functions with small mixed smoothness
• Constructive sparse trigonometric approximations for the functions with generalized mixed smoothness
• Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
• Approximation from sparse grids and function spaces of dominating mixed smoothness
• Multivariate approximation

Cited in

(29)

• On estimates for orders of best \(M\)-term approximations of multivariate functions in anisotropic Lorentz-karamata spaces
• Constructive sparse trigonometric approximation for functions with small mixed smoothness
• Approximation by quasi-interpolation operators and Smolyak's algorithm
• Best \(m\)-term trigonometric approximation for periodic functions with low mixed smoothness from the Nikol'skii-Besov-type classes
• New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness
• Sampling numbers of smoothness classes via \(\ell^1\)-minimization
• The Marcinkiewicz-type discretization theorems
• Approximation of functions with small mixed smoothness in the uniform norm
• Estimates of \(M\)-term approximations of functions of several variables in the Lorentz space by a constructive method
• Rate-optimal sparse approximation of compact break-of-scale embeddings
• Constructive sparse trigonometric approximations for the functions with generalized mixed smoothness
• Metric entropy and sparse linear approximation of \(\ell_q\)-hulls for \(0<q\leq 1\)
• On estimates of the order of the best M-term approximations of functions of several variables in the anisotropic Lorentz-Zygmund space
• Weak forms of unconditionality of bases in greedy approximation
• Approximation from sparse grids and function spaces of dominating mixed smoothness
• On estimates of \(m\)-term approximations on classes of functions with bounded mixed derivative in the Lorentz space
• Random points are good for universal discretization
• The best \(m\)-term approximations on generalized Besov classes \(M\, B_{q, \theta}^{\Omega}\) with regard to orthogonal dictionaries
• Nonlinear trigonometric approximations of multivariate function classes
• Sparse approximation of some function classes with respect to multiple Haar system on the unit cube
• Greedy algorithms with regard to multivariate systems with special structure
• Nonlinear approximation of function spaces of mixed smoothness
• Sparse-grid sampling recovery and numerical integration of functions having mixed smoothness
• Best \(n\)-term approximation of diagonal operators and application to function spaces with mixed smoothness
• Greedy algorithm with gaps
• On the entropy numbers of the mixed smoothness function classes
• Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube
• Sparse approximation by greedy algorithms
• The role of Frolov's cubature formula for functions with bounded mixed derivative

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)