Sampling and cubature on sparse grids based on a B-spline quasi-interpolation

From MaRDI portal
Publication:515985

DOI10.1007/S10208-015-9274-8zbMATH Open1359.41001arXiv1211.4319OpenAlexW76303595MaRDI QIDQ515985FDOQ515985

Dinh Dũng

Publication date: 17 March 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: Let Xn=xjj=1n be a set of n points in the d-cube [0,1]d, and Phin=varphijj=1n a family of n functions on [0,1]d. We consider the approximate recovery functions f on [0,1]d from the sampled values f(x1),...,f(xn), by the linear sampling algorithm �egin{equation} onumber 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 Lq([0,1]d)-norm or the energy norm of the isotropic Sobolev sapce Wgammaq([0,1]d) for 0<qleinfty and gamma>0. Functions f to be recovered are from the unit ball in Besov type spaces of an anisotropic smoothness, in particular, spaces Bp,hetaa of a nonuniform mixed smoothness ainmathbbR+d, and spaces of a "hybrid" of mixed smoothness alpha>0 and isotropic smoothness . We constructed optimal linear sampling algorithms Ln(Xn*,Phin*,cdot) on special sparse grids Xn* and a family Phin* 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 Bp,hetaa 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.


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




Recommendations




Cites Work


Cited In (22)





This page was built for publication: Sampling and cubature on sparse grids based on a B-spline quasi-interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515985)