Adaptive sampling recovery of functions with higher mixed regularity

04/07/2020
by   Nadiia Derevianko, et al.
0

We tensorize the Faber spline system from [14] to prove sequence space isomorphisms for multivariate function spaces with higher mixed regularity. The respective basis coefficients are local linear combinations of discrete function values similar as for the classical Faber Schauder system. This allows for a sparse representation of the function using a truncated series expansion by only storing discrete (finite) set of function values. The set of nodes where the function values are taken depends on the respective function in a non-linear way. Indeed, if we choose the basis functions adaptively it requires significantly less function values to represent the initial function up to accuracy ε>0 (say in L_∞) compared to hyperbolic cross projections. In addition, due to the higher regularity of the Faber splines we overcome the (mixed) smoothness restriction r<2 and benefit from higher mixed regularity of the function. As a byproduct we present the solution of Problem 3.13 in the Triebel monograph [46] for the multivariate setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2019

A higher order Faber spline basis for sampling discretization of functions

This paper is devoted to the question of constructing a higher order Fab...
research
10/04/2022

L_p-Sampling recovery for non-compact subclasses of L_∞

In this paper we study the sampling recovery problem for certain relevan...
research
09/10/2023

Sparse-grid sampling recovery and numerical integration of functions having mixed smoothness

We give a short survey of recent results on sparse-grid linear algorithm...
research
04/27/2023

Tractability of sampling recovery on unweighted function classes

It is well-known that the problem of sampling recovery in the L_2-norm o...
research
12/01/2022

Sampling numbers of smoothness classes via ℓ^1-minimization

Using techniques developed recently in the field of compressed sensing w...
research
10/02/2021

Efficiently transforming from values of a function on a sparse grid to basis coefficients

In many contexts it is necessary to determine coefficients of a basis ex...
research
03/18/2022

Rate-optimal sparse approximation of compact break-of-scale embeddings

The paper is concerned with the sparse approximation of functions having...

Please sign up or login with your details

Forgot password? Click here to reset