Adaptive sampling recovery of functions with higher mixed regularity

Abstract

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 Triebel's monograph [46] for the multivariate setting.