Constructive sparse trigonometric approximation for functions with small mixed smoothness

03/01/2015
by   V. N. Temlyakov, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2015

Sparse approximation by greedy algorithms

It is a survey on recent results in constructive sparse approximation. T...
research
05/11/2020

Towards 1ULP evaluation of Daubechies Wavelets

We present algorithms to numerically evaluate Daubechies wavelets and sc...
research
12/17/2020

Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness

Results on asymptotic characteristics of classes of functions with mixed...
research
02/28/2016

On the entropy numbers of the mixed smoothness function classes

Behavior of the entropy numbers of classes of multivariate functions wit...
research
03/30/2020

Numerical integration without smoothness assumption

We consider numerical integration in classes, for which we do not impose...
research
11/06/2019

Sparse approximation of individual functions

Results on two different settings of asymptotic behavior of approximatio...
research
02/13/2022

Local approximation of operators

Many applications, such as system identification, classification of time...

Please sign up or login with your details

Forgot password? Click here to reset