Sampling and cubature on sparse grids based on a B-spline quasi-interpolation
Abstract
Let be a set of points in the -cube , and a family of functions on . We consider the approximate recovery functions on from the sampled values , by the linear sampling algorithm \begin{equation} \nonumber L_n(X_n,\Phi_n,f) \ := \ \sum_{j=1}^n f(x^j)\varphi_j. \end{equation} The error of sampling recovery is measured in the norm of the space -norm or the energy norm of the isotropic Sobolev sapce for and . Functions to be recovered are from the unit ball in Besov type spaces of an anisotropic smoothness, in particular, spaces of a nonuniform mixed smoothness , and spaces of a "hybrid" of mixed smoothness and isotropic smoothness . We constructed optimal linear sampling algorithms on special sparse grids and a family of linear combinations of integer or half integer translated dilations of tensor products of B-splines. We computed the asymptotic of the error of the optimal recovery. This construction is based on a B-spline quasi-interpolation representations of functions in and . As consequences we obtained the asymptotic of optimal cubature formulas for numerical integration of functions from the unit ball of these Besov type spaces.
Keywords
Cite
@article{arxiv.1211.4319,
title = {Sampling and cubature on sparse grids based on a B-spline quasi-interpolation},
author = {Dinh Dũng},
journal= {arXiv preprint arXiv:1211.4319},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1009.4389