English

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

Numerical Analysis 2015-11-10 v6

Abstract

Let Xn={xj}j=1nX_n = \{x^j\}_{j=1}^n be a set of nn points in the dd-cube [0,1]d[0,1]^d, and Φn={φj}j=1n\Phi_n = \{\varphi_j\}_{j =1}^n a family of nn functions on [0,1]d[0,1]^d. We consider the approximate recovery functions ff on [0,1]d[0,1]^d from the sampled values f(x1),...,f(xn)f(x^1), ..., f(x^n), 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 Lq([0,1]d)L_q([0,1]^d)-norm or the energy norm of the isotropic Sobolev sapce Wqγ([0,1]d)W^\gamma_q([0,1]^d) for 0<q0 < q \le \infty and γ>0\gamma > 0. Functions ff to be recovered are from the unit ball in Besov type spaces of an anisotropic smoothness, in particular, spaces Bp,θaB^a_{p,\theta} of a nonuniform mixed smoothness aR+da \in {\mathbb R}^d_+, and spaces Bp,θα,βB^{\alpha,\beta}_{p,\theta} of a "hybrid" of mixed smoothness α>0\alpha > 0 and isotropic smoothness βR\beta \in \mathbb R. We constructed optimal linear sampling algorithms Ln(Xn,Φn,)L_n(X_n^*,\Phi_n^*,\cdot) on special sparse grids XnX_n^* and a family Φn\Phi_n^* 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,θaB^a_{p,\theta} and Bp,θα,βB^{\alpha,\beta}_{p,\theta}. 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

R2 v1 2026-06-21T22:40:32.801Z