Abstract
We proved direct and inverse theorems on B-spline quasi-interpolation sampling representation with a Littlewood-Paley-type norm equivalence in Sobolev spaces \({W^{r}_{p}}\) of mixed smoothness r. Based on this representation, we established estimates of the approximation error of recovery in L q -norm of functions from the unit ball \({U^{r}_{p}}\) in the spaces \({W^{r}_{p}}\) by linear sampling algorithms and the asymptotic optimality of these sampling algorithms in terms of Smolyak sampling width \({r^{s}_{n}}({U^{r}_{p}}, L_{q})\) and sampling width \(r_{n}({U^{r}_{p}}, L_{q})\).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The purpose of the present paper is to study B-spline quasi-interpolation sampling representations with Littlewood-Paley-type norm equivalence in Sobolev spaces of a mixed smoothness, linear sampling algorithms on Smolyak grids based on them for recovery of functions from these spaces, and the optimality of these algorithms. We are interested in quasi-interpolation sampling representation and sampling recovery of functions on \(\mathbb {R}^{d}\) which are 1-periodic at each variable. It is convenient to consider them as functions on the d-torus \(\mathbb {T}^{d}\) which is defined as the cross product of d copies of the interval [0, 1] with the identification of the end points. To avoid confusion, we use the notation \(\mathbb {I}^{d}\) to denote the standard unit d-cube [0, 1]d. Let us first briefly describe the main contributions of our paper. The historical comments will be given after.
For 1 ≤ p ≤ ∞ and r > 0, denote by \({W^{r}_{p}}\) the Sobolev-type space of functions on \(\mathbb {T}^{d}\) having uniform mixed smoothness r. If 1 < p < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell - 1\), then we prove that every function \(f \in {W^{r}_{p}}\) can be represented as B-spline series
converging in the norm of \({W^{r}_{p}}\), where the coefficient functionals c k,s (f) are explicitly constructed as linear combinations of at most m 0 of function values of f for some \(m_{0} \in \mathbb N\) which is independent of k,s and f, N k,s are the tensor product of integer translates of dyadic scaled periodic B-splines of even order ℓ (see Section 2.1 for details), and
Moreover, for this representation there holds the norm equivalence
Let \(\mathbf {X}_{n} = \{\mathbf {x}^{j}\}_{j = 1}^{n}\) be a set of n points in \(\mathbb {T}^{d}\), \({\Phi }_{n} = \{\varphi _{j}\}_{j = 1}^{n}\) a family of n functions on \(\mathbb {I}^{d}\). If f is a function on \(\mathbb {T}^{d}\), for approximately recovering f from the sampled values f(x 1), …, f(x n), we define the linear sampling algorithm L n (X n , Φ n , ⋅) by
Based on the B-spline quasi-interpolation representation (1), we construct linear sampling algorithms on Smolyak grids induced by partial sums of the series in (1) as follows. For \(m \in \mathbb N\), the well known periodic Smolyak grid of points \(G^{d}(m) \subset \mathbb {T}^{d}\) is defined as
Here and in what follows, we use the notations: \(\mathbb {Z}_{+}:= \{s \in \mathbb {Z}\,:\, s \ge 0 \}\); x y := (x 1 y 1, …, x d y d ); \(2^{\mathbf {x}} := (2^{x_{1}},\dots ,2^{x_{d}})\); \(|\mathbf {x}|_{1} := {\sum }_{i = 1}^{d} |x_{i}|\) for \(\mathbf {x}, \mathbf {y} \in \mathbb {R}^{d}\); [n] denotes the set of all natural numbers from 1 to n; x i denotes the ith coordinate of \(\mathbf {x} \in \mathbb {R}^{d}\), i.e., x := (x 1, …, x d ). For \(m \in \mathbb {Z}_{+}\), we define the operator R m by
For functions f on \(\mathbb {T}^{d}\), R m defines the linear sampling algorithm on the Smolyak grid G d(m)
where n := |G d(m)|, Y n := {y ∈ G d(m)}, \({\Phi }_{n}:= \{\varphi _{\mathbf {y}}\}_{\mathbf {y} \in G^{d}(m)}\) and for y = 2−k s, φ y are explicitly constructed as linear combinations of at most m 0 B-splines N k,j for some \(m_{0} \in \mathbb N\) which is independent of k, s, m and f.
Let 1 < p, q < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell \). Then by using the B-spline quasi-interpolation representation (1) with norm equivalence (2) we prove that
Let us introduce the Smolyak sampling width \({r^{s}_{n}}(F)_{q}\) characterizing optimality of sampling recovery on Smolyak grids G d(m) with respect to the function class F by
where for a family \({\Phi }_{m} = \{\varphi _{\mathbf {y}}\}_{\mathbf {y} \in G^{d}(m)}\) of functions we define the linear sampling algorithm S m (Φ m , ⋅) on Smolyak grids G d(m) by
The upper index s indicates that we restrict to Smolyak grids here. Let 1 < p,q < ∞ and \(r > \max (\frac {1}{p},\frac {1}{2})\). Denote by \({U^{r}_{p}}\) the unit ball in the space \({W^{r}_{p}}\). Then we prove the asymptotic order
The upper bound follows from (4), while the lower bound is established by construction of test functions which is based in the inverse theorem of sampling representation (see Theorem 3.2 below). Moreover, the linear sampling algorithms R m (⋅) on the Smolyak grid G d(m) for which n := |G d(m)|, are asymptotically optimal for \({r_{n}^{s}}({U^{r}_{p}},L_{q}) \).
To study optimality of linear sampling algorithms of the form (3) for recovering f ∈ F from n of their values, we can use also the sampling width
For \(r > \max (\frac {1}{p},\frac {1}{2})\) and 1 < p < q ≤ 2 or 2 ≤ p < q < ∞, as a consequence of (4) and a result on linear width proven in [22] we obtain the asymptotic order
The sparse grids G d(m) for sampling recovery and numerical integration were first considered by Smolyak [35]. In [36,37,38,39] and [10,11,12], Smolyak’s construction was developed for studying the trigonometric sampling recovery and sampling width for periodic Sobolev classes and Nikol’skii classes having mixed smoothness. Recently, the sampling recovery for Sobolev and Besov classes having mixed smoothness has been investigated in [5, 6, 17, 18, 20, 32, 33, 41]. In particular, for non-periodic functions of mixed smoothness linear sampling algorithms on Smolyak grids have been recently studied in [40] (d = 2), [17, 18, 20, 33] using B-spline quasi-interpolation sampling representation. For 1 ≤ p,q ≤ ∞, 0 < 𝜃 ≤ ∞ and r > 1/p, the asymptotic order of the Smolyak sampling width \({r^{s}_{n}}(U^{r}_{p,\theta },L_{q})\) has been established in [17, 20] where \(U^{r}_{p,\theta }\) is the Besov class of uniform mixed smoothness r. The first asymptotic order of sampling width \(r_{n}(U^{r}_{p,\infty },L_{q})\) for 1 < p < q ≤ 2,r > 1/p, among classes of mixed smoothness was obtained in [10, 11]. For Sobolev classes of mixed smoothness, the first asymptotic order of sampling width \(r_{n}({U^{r}_{2}},L_{\infty })\) was obtained in [38].
It is remarkable to notice that so far the asymptotic orders of the sampling widths \(r_{n}(U^{r}_{p,\theta },L_{q})\) and \(r_{n}({U^{r}_{p}},L_{q})\) are known only in some cases with the condition p < q, for which the sampling algorithms R m on the Smolyak grid G d(m) are asymptotically optimal. Even the asymptotic order of the “simplest” sampling widths \(r_{n}({U^{r}_{2}},L_{2})\) is still an outstanding open problem.
In numerical applications for approximation problems involving a large number of variables, Smolyak grids was first considered in [43]. For non-periodic functions of mixed smoothness of integer order, linear sampling algorithms on Smolyak grids have been investigated in [4] employing hierarchical Lagrangian polynomials multilevel basis. There is a very large number of papers on Smolyak grids and their modifications in various problems of approximations, sampling recovery and integration with applications in data mining, mathematical finance, learning theory, numerical solving of PDE and stochastic PDE, etc. to mention all of them. The reader can see the surveys in [4, 25, 30] and the references therein.
Quasi-interpolation based on scaled B-splines with integer knots and constructed from function values at dyadic lattices, possesses good local and approximation properties for smooth functions, see [9, p. 63–65], [8, p. 100–107]. It can be an efficient tool in some high-dimensional approximation problems, especially in applications ones. Thus, one of the important bases for sparse grid high-dimensional approximations having various applications are the Faber functions (hat functions) which are piecewise linear B-splines of second order [3, 4, 24,25,26,27,28]. The representation by Faber basis can be obtained by the B-spline quasi-interpolation (see, e. g., [17]).
A central role in sampling recovery of functions having a mixed smoothness (or more generally an anisotropic smoothness) play sampling representations which are based on dyadic scaled B-splines with integer knots or trigonometric kernels and constructed from function values at dyadic lattices. These representations are in the form of a B-spline or trigonometric polynomial series provided with discrete equivalent norm for functions in Hölder-Nikol’skii- and Besov-types spaces of a mixed smoothness. By employing them, we can construct sampling algorithms for recovery on Smolyak-type grids of functions from the corresponding spaces which in some cases give the asymptotically optimal rate of the approximation error. While the quasi-interpolation and trigonometric sampling representation theorems are already established for Hölder-Nikol’skii- and Besov-types spaces of a mixed smoothness [11, 14, 17, 18], they are almost not formulated for Sobolev-type spaces of a mixed smoothness. Only a few particular cases are known for a small uniform mixed smoothness [7, 40]. The relations (1) and (2) present a Littlewood-Paley-type theorem on B-spline quasi-interpolation sampling representation for periodic Sobolev-type spaces of arbitrary uniform mixed smoothness. Its proof requires tools from Fourier analysis, i.e., maximal functions of Peetre and Hardy-Littlewood type. Moreover, it is essentially based on a special explicit formula for the coefficients c k,s (f) in the representation (1) which is associated with high order difference operators, and on its specific property of that the component functions q s (f) can be split into a finite sum of the B-splines N s,k having non-overlap interiors of their supports.
A trigonometric counterpart of this theorem as well as sampling recovery based on it have been investigated in [6]. Finally, we refer the reader to the survey [19] for various aspects, recent development and bibliography on sampling recovery of functions having mixed smoothness and related problems in particular for announcement of the main results of the present paper.
The paper is organized as follows. In Section 2, we present a B-spline quasi-interpolation sampling representation for continuous functions on \(\mathbb {T}^{d}\), and prove an explicit formula for the coefficient functionals in this representation. In Section 3, we prove direct and inverse Littlewood-Paley-type theorems for Sobolev spaces \({W^{r}_{p}}\). In Section 4, we investigate the sampling recovery in L q -norm for Sobolev classes \({U^{r}_{p}}\) by linear sampling algorithms induced by partial sums of B-spline quasi-interpolation sampling representation, optimality of sampling recovery on Smolyak grids and the asymptotic order of \({r^{s}_{n}}({U^{r}_{p}},L_{q})\) and \(r_{n}({U^{r}_{p}},L_{q})\).
2 B-Spline Quasi-Interpolation Sampling Representations
2.1 B-Spline Quasi-Interpolations and Sampling Representations
In order to construct B-spline quasi-interpolation sampling representations for continuous functions on \(\mathbb {T}^{d}\), we preliminarily introduce quasi-interpolation operators for functions on \(\mathbb {R}^{d}\). For a given natural number ℓ, denote by M ℓ the cardinal B-spline of order ℓ with support [0, ℓ] and knots at the points 0, 1, …, ℓ. We fix an even number \(\ell \in \mathbb N\) and take the cardinal B-spline M = M ℓ of order ℓ. Let Λ = {λ(s)}|j| ≤μ be a given finite even sequence, i.e., λ(−j) = λ(j) for some \(\mu \ge \frac {\ell }{2} - 1\). We define the linear operator Q for functions f on \(\mathbb {R}\) by
where
The operator Q is local and bounded in \(C(\mathbb {R})\) (see [8, p. 100–109]). An operator Q of the form (5)–(6) is called a quasi-interpolation operator in \(C(\mathbb {R})\) if it reproduces \(\mathcal P_{\ell -1}\), i.e., Q(f) = f for every \(f \in \mathcal P_{\ell -1}\), where \(\mathcal P_{\ell -1}\) denotes the set of d-variate polynomials of degree at most ℓ − 1 in each variable.
If Q is a quasi-interpolation operator of the form (5)–(6), for h > 0 and a function f on \(\mathbb {R}\), we define the operator Q(⋅; h) by Q(f; h) := σ h ∘ Q ∘ σ 1/h (f), where σ h (f, x) = f(x/h). Let Q be a quasi-interpolation operator of the form (5)–(6) in \(C(\mathbb {R})\). If \(k \in \mathbb {Z}_{+} \), we introduce the operator Q k by
We define the integer translated dilation M k,s of M by
Then we have for \(k \in \mathbb {Z}_{+}\),
where the coefficient functional a k,s is defined by
Notice that Q k (f) can be written in the form:
where the function L k is defined by
From (8) and (9), we get for a function f on \(\mathbb {R}\),
where
For \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), let the mixed operator Q k be defined by
where the univariate operator \(Q_{k_{i}}\) is applied to the univariate function f by considering f as a function of variable x i with the other variables held fixed. We define the d-variable B-spline M k,s by
where \(\mathbb {Z}^{d}_{+}:= \{\mathbf {s} \in \mathbb {Z}^{d}\,:\, s_{i} \ge 0, i \in [d] \}\). Then we have
where M k,s is the mixed B-spline defined in (13), and
and the univariate coefficient functional \(a_{k_{i},s_{i}}\) is applied to the univariate function f by considering f as a function of variable x i with the other variables held fixed.
Since M(ℓ 2k x) = 0 for every \(k \in \mathbb {Z}_{+}\) and x∉(0, 1), we can extend the univariate B-spline M(ℓ 2k⋅) to an 1-periodic function on the whole \(\mathbb {R}\). Denote this periodic extension by N k and define
where I(k) := {0, 1, …, ℓ2k − 1}. We define the d-variable B-spline N k,s by
where \( I(\mathbf {k}):={\prod }_{i = 1}^{d} I(k_{i})\). Then we have for functions f on \(\mathbb {T}^{d}\),
Since the function L Λ defined in (11) is 1-periodic, from (10) it follows that for a function f on \(\mathbb T\),
For \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), we write k → ∞ if k i → ∞ for i ∈ [d]). In a way similar to the proof of [18, Lemma 2.2], one can show that for every \(f \in C(\mathbb {T}^{d})\),
For convenience, we define the univariate operator Q − 1 by putting Q − 1(f) = 0 for all f on \(\mathbb I\). Let the operators q k be defined in the manner of the definition (12) by
From the equation \(Q_{\mathbf {k}} = {\sum }_{\mathbf {k}^{\prime } \le \mathbf {k}}q_{\mathbf {k}^{\prime }}\) and (16), it is easy to see that a continuous function f has the decomposition \( f = {\sum }_{\mathbf {k} \in \mathbb {Z}^{d}_{+}} q_{\mathbf {k}}(f)\) with the convergence in the norm of \(C(\mathbb {T}^{d})\). From the refinement equation for the B-spline M, in the univariate case, we can represent the component functions q k (f) as
where c k,s are certain coefficient functionals of f. In the multivariate case, the representation (17) holds true with the c k,s which are defined in the manner of the definition (14) by
See [17] for details. Thus, we have proven the following periodic B-spline quasi-interpolation representation for continuous functions on \(\mathbb {T}^{d}\).
Lemma 2.1
Every continuous function f on \(\mathbb {T}^{d}\) is represented as B-spline series
converging in the norm of \(C(\mathbb {T}^{d})\) , where the coefficient functionals c k,s (f) are explicitly constructed as linear combinations of at most m 0 of function valuesof f for some \(m_{0} \in \mathbb N\) which is independent of k, s, and f.
2.2 A Formula for the Coefficients in B-Spline Quasi-Interpolation Representations
In this subsection, we find an explicit formula for the coefficients c k,s (f) in the representation (18) related to the ℓth difference operator \({\Delta }_{\mathbf {h}}^{\ell }\), which plays an important role in the proof of a direct theorem of sampling representation of functions in the Sobolev space \({W^{r}_{p}}\).
For univariate functions f on \(\mathbb T\), the ℓth difference operator \({\Delta }_{h}^{\ell }\) is defined by
If u is any subset of [d], the mixed (ℓ,u)th difference operator \({\Delta }_{\mathbf {h}}^{\ell ,u}\) for multivariate functions on \(\mathbb {T}^{d}\) is defined by
where the univariate operator \({\Delta }_{h_{i}}^{\ell }\) is applied to the univariate function f by considering f as a function of variable x i with the other variables held fixed, and I(f) := f for functions f on \(\mathbb {T}^{d}\). We also use the abbreviation \({\Delta }_{\mathbf {h}}^{\ell }:= {\Delta }_{\mathbf {h}}^{\ell ,[d]}\).
If \(\mathbf {h} \in \mathbb {R}^{d}\), we define the shift operator T h for functions f on \(\mathbb {T}^{d}\) by T h (f) := f(⋅ + h). Recall that a d-variate Laurent polynomial is a function P of the form
where A is a finite subset in \(\mathbb {Z}^{d}\) and \(\mathbf {z}^{\mathbf {s}}:= {\prod }_{j = 1}^{d} z_{j}^{s_{j}}\). A d-variate Laurent polynomial P as (20) generates the operator \(T_{\mathbf {h}}^{[P]}\) by
Sometimes we also write \(T_{\mathbf {h}}^{[P]}=T_{\mathbf {h}}^{[P(\mathbf {z})]}\). Notice that any operation over polynomials generates a corresponding operation over operators \(T_{\mathbf {h}}^{[P]}\). Thus, in particular, we have
By definitions we have
We say that a d-variate polynomial is a tensor product polynomial if it is of the form \( P(\mathbf {z}) = {\prod }_{j = 1}^{d} P_{j}(z_{j}),\) where P j (z j ) are univariate polynomial in variable z j .
Lemma 2.2
Let P be a tensor product Laurent polynomial, \(\mathbf {h} \in \mathbb {R}^{d}\) with h j ≠ 0, and \(\ell \in \mathbb N\) . Assume that \(T_{\mathbf {h}}^{[P]}(g)= 0\) for every polynomial \(g \in \mathcal P_{\ell -1}\) . Then P has a factor D ℓ and consequently,
where P ∗ is atensor product Laurent polynomial.
Proof
By the tensor product argument, it is enough to prove the lemma for the case d = 1. We prove this case by induction on l. Let \(P(z)={\sum }_{s = -m}^{n} c_{s} z^{s}\) for some \(m,n \in \mathbb {Z}_{+}\). Consider first the case l = 1. Assume that \(T_{h}^{[P]}(g)= 0\) for every constant function g. Then replacing by g 0 = 1 in (21) we get \( T_{h}^{[P]}(g_{0}) = {\sum }_{s = -m}^{n} c_{s} = 0\). By Bézout’s theorem P has a factor (z − 1). This proves the lemma for l = 1. Assume it is true for l − 1 and \(T_{h}^{[P]}(g)= 0\) for every polynomial g of degree at most l − 1. By the induction assumption, we have
We take a proper polynomial g l of degree l − 1 (with the nonzero eldest coefficient). Hence, \(\psi _{l} = {\Delta }_{h}^{l-1}(g_{l}) = a\) where a is a nonzero constant. Similarly to the case l = 1, from the equations \( 0 = T_{h}^{[P]} (g_{l}) = T_{h}^{[P_{1}]} (\psi _{l})\) we conclude that P 1 has a factor (z − 1). Hence, by (22) we can see that P has a factor (z − 1)l. The lemma is proved. □
Let us return to the definition of quasi-interpolation operator Q of the form (5) induced by the sequence Λ as in (6) which can be uniquely characterized by the univariate symmetric Laurent polynomial
Let the d-variate symmetric tensor product Laurent polynomial P Λ be given by
For the periodic quasi-interpolation operator
given as in (15), from (7) we get
where \(\mathbf {h}^{(\mathbf {k})}:= \left (h_{1}^{(k_{1})},\dots ,h_{d}^{(k_{d})}\right )\).
Let us first find an explicit formula for the univariate operator Q k (f). We have for k > 0,
From (24) and the refinement equation for M, we deduce that
By the identities h (k− 1) = 2h (k), \(N_{k,\ell 2^{k} +m} = N_{k,m}\) and f(h (k))(ℓ2k + m) = f(h (k) m) for \(k \in \mathbb {Z}_{+}\) and \(m \in \mathbb {Z}\), we have
where
In a similar way, we obtain
where
We define
Then from the definition q k (f) = Q k (f) − Q k−1(f), we get the following representation for q k (f),
and for k > 0,
with
From the definitions of Q k and q k it follows that
By using Lemma 2.2, we prove the following lemma for the univariate operators q k .
Lemma 2.3
We have
where \(P_{\text {even}}^{*}\) , \(P_{\text {odd}}^{*}\) are a symmetric Laurent polynomial. Therefore, in the representation (28)–(29) of Q k (f), we have for k > 0,
Equivalently, in the representation (17) of Q k (f), we have for s ∈ I(0)
and for k > 0 and s ∈ I(k),
Proof
Consider the representation (17) for Q k (f) and d = 1. If g is an arbitrary polynomial of degree at most ℓ − 1, then since Q k reproduces g we have Q k (g) = 0 and consequently, c k,s (g) = 0 for k > 0. The (28)–(29) give an explicit formula for the coefficient c k,s (g) as \(T_{h^{(k)}}^{[P_{\text {even}}]}(g)(2sh^{(k)})\) and \(T_{h^{(k)}}^{[P_{\text {odd}}]}(g)((2s + 1)h^{(k)})\). Hence, by Lemma 2.2 we get (30). □
Put \(\mathbb {Z}_{+}:= \{s \in \mathbb {Z}\,:\, s \ge 0 \}\) and \(\mathbb {Z}^{d}_{+}(u):= \{\mathbf {s} \in \mathbb {Z}^{d}_{+}\,:\, s_{i} = 0 , i \notin u\}\) for a set u ⊂ [d].
Theorem 2.1
In the representation (17) of Q k (f), we have for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}(u)\) and s ∈ I(k),
where
Proof
Indeed, from the definition of c k,s (f) and Lemma 2.3, we have for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}(u)\) and s ∈ I(k),
where
□
2.3 Examples
The operator Q is induced by the sequence Λ as in (6) which can be uniquely characterized by the univariate symmetric Laurent polynomial P Λ. In this subsection, we give some examples of the univariate symmetric Laurent polynomial P Λ characterizing the quasi-interpolation operator Q of the form (5). For a given P Λ, the Laurent polynomials \(P_{\text {odd}}^{*}\) and \(P_{\text {odd}}^{*}\) can be computed from (25)–(27).
Let us consider the case ℓ = 2 when M(x) = (1 −|x − 1|)+ is the piece-wise linear cardinal B-spine with knots at 0,1,2. Let Λ = {λ(s)} j= 0(μ = 0) be given by λ(0) = 1. If N k is the periodic extension of M(2k+1⋅), then
where I(k) := {0, 1, …, 2k+ 1 − 1}. Consider the related periodic nodal quasi-interpolation operator for functions f on \(\mathbb T\) and \(k \in \mathbb {Z}_{+}\),
We have
Hence,
and for k > 0,
We show that after redefining N k,2s as φ k,s , the quasi-interpolation representation (18) becomes the classical periodic Faber series. We introduce the univariate hat functions φ k,s by
where Z(0) := {0} and Z(k) := {0, 1, …, 2k− 1 − 1}. Put \(Z(\mathbf {k}):= {\prod }_{i = 1}^{d} Z(k_{i})\). For \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), s ∈ Z(k), define the d-variate hat functions
and the d-variate periodic Faber system \(\mathcal F_{d}\) by
For functions f on \(\mathbb T\), we define the univariate linear functionals λ k,s by
Let the d-variate linear functionals λ k,s be defined as
where the univariate functional \(\lambda _{k_{i},s_{i}}\) is applied to the univariate function f by considering f as a function of variable x i with the other variables held fixed. It is well known that the d-variate periodic Faber system \(\mathcal F_{d}\) is a basis in \(C(\mathbb {T}^{d})\), and a function \(f \in C(\mathbb {T}^{d})\) can be represented by the Faber series
converging in the norm of \(C(\mathbb {T}^{d})\).
Let us consider the case ℓ = 4 when M(x) is the cubic cardinal B-spine with knots at 0, 1,2,3,4. We define a sequence Λ of the form (6) inducing a quasi-interpolation Q via the polynomial P Λ as in (23) which uniquely defines Λ. One of possible choices is
Then, we have
3 Direct and Inverse Theorems of Sampling Representation
3.1 Function Spaces of Mixed Smoothness
We define the univariate Bernoulli kernel
and the multivariate Bernoulli kernels as the corresponding tensor products
Let r > 0 and 0 < p ≤ ∞. Denote by \(L_{p} = L_{p}(\mathbb {T}^{d})\) the quasi-normed space of functions on \(\mathbb {T}^{d}\) with the p th integral quasi-norm ∥⋅∥ p for 0 < p < ∞, and the ess sup-norm ∥⋅∥ p for p = ∞. If r > 0 and 1 ≤ p ≤ ∞, we define the Sobolev space \({W^{r}_{p}}\) of mixed smoothness r by
and \(\|f\|_{{W^{r}_{p}}}:= \|\varphi \|_{p}\) for f represented as in (31). For 1 < p < ∞, the space \({W^{r}_{p}}\) coincides with the set of all f ∈ L p such that the norm
is finite, where \(\hat f(\mathbf {s})\) denotes the usual s th Fourier coefficient of f. There are some different equivalent definitions of \({W^{r}_{p}}\), for instance, in terms of Weil fractional derivatives (see, e.g, [13]).
We use the notations: A n (f) ≪ B n (f) if A n (f) ≤ C B n (f) with C an absolute constant not depending on n and/or f ∈ W, and A n (f) ≍ B n (f) if A n (f) ≪ B n (f) and B n (f) ≪ A n (f). Denote by ⌊y⌋ the integer part of \(y \in \mathbb {R}\). For a function f ∈ L p and a vector \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\) we define the set
and the function
For the following lemma see [31] (also [2, Chapter III, 15.2]).
Lemma 3.1
Let 1 < p < ∞ and r > 0. Then we have the following norm equivalence
Put \(P_{\mathbf {k}}:= \{\mathbf {h} \in \mathbb {R}^{d}\,:\, |h_{i}| \le 2^{-k_{i}}, i \in [d]\}\). The following lemma has been proven in [42].
Lemma 3.2
Let 1 < p < ∞ and r < ℓ . Then we have the following norm equivalence
For u ⊂ [d], let
be the mixed (ℓ, u)th modulus of smoothness of f (in particular, \(\omega _{l}^{\varnothing }(f,t)_{p} = \|f\|_{p}\)).
If 0 < p, 𝜃 ≤ ∞, r > 0 and ℓ > r, we introduce the quasi-semi-norm \(|f|_{B_{p, \theta }^{r,u}}\) for functions f ∈ L p by
(in particular, \(|f|_{B_{p, \theta }^{\alpha ,\emptyset }} = \|f\|_{p}\)).
For 0 < p,𝜃 ≤ ∞ and 0 < r < l, the Besov space \(B_{p, \theta }^{r}\) is defined as the set of functions f ∈ L p for which the Besov quasi-norm \(\|f\|_{B_{p, \theta }^{r}}\) is finite. The Besov quasi-norm is defined by
3.2 Maximal Functions
For a locally integrable function f on \(\mathbb T\), the Hardy-Littlewood maximal function is defined as
For i ∈ [d] and a locally integrable function f on \(\mathbb T^{d}\), the partial Hardy-Littlewood maximal function M i (f) is defined as the univariate maximal function in variable x i by considering f as a univariate function of x i with the other variables held fixed. The mixed Hardy-Littlewood maximal function is defined as
From a result in [21], one gets
Lemma 3.3
Let 1 < p < ∞ and \((f_{\mathbf {k}})_{\mathbf {k} \in \mathbb {Z}^{d}_{+}}\) be a sequence of locally integrable functions on \(\mathbb {T}^{d}\) . Then we have
Let \(\mathbf {m}, \mathbf {n} \in \mathbb {R}^{d}\) with positive components. For a continuous function f on \(\mathbb {T}^{d}\), the Peetre maximal function is defined as
If n = (n, …, n), we write P m,n (f,x) := P m,n (f, x).
For the proof of the following lemma see [34, Lemma 2.3.3] and [42, Lemma 3.3.1].
Lemma 3.4
For the univariate trigonometric polynomial f of degree ≤ m , we have
where C > 0 is a constantindependent of f, m, h.
For the proof of the following lemma see [42].
Lemma 3.5
Let 1 < p < ∞ and \((f_{\mathbf {k}})_{\mathbf {k} \in \mathbb {Z}^{d}_{+}}\) be a sequence of trigonometric polynomials f k of degree m (k) , and n (k) be such that \(n^{(\mathbf {k})}_{i} > \max (\frac {1}{p},\frac {1}{2})\) , i ∈ [d]. Then we have
where C > 0 is a constantindependent of f and \((\mathbf {m}^{(\mathbf {k})})_{\mathbf {k} \in \mathbb {Z}^{d}_{+}}\).
3.3 Direct Theorem of Sampling Representation
In this subsection, we prove the following direct theorem of B-spline sampling representation in Sobolev space of mixed smoothness.
Theorem 3.1
Let 1 < p < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell \) . Then every function \(f \in {W^{r}_{p}}\) can be represented as the series (18) converging in the norm of \({W^{r}_{p}}\) , and there holds the inequality
Proof
Let \(f \in {W^{r}_{p}}\). Put
and I n (k) := n + I ∗(k) for n ∈ {0, …, ℓ − 1}d. Then we can split q k (f) into a sum as
Hence,
and consequently, to prove (32) it is sufficient to show that each term in the sum in the right hand side \(\ll \|f\|_{{W^{r}_{p}}}\). We prove this for instance, for the term corresponding to n = 0. Let us rewrite the inequality to be proven in the following more convenient form
For a vector \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), we define the function
Notice that since \(f \in {W^{r}_{p}}\) with \(r > \frac {1}{p}\), we can write for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\),
which yields the inequality
We give a preliminary estimate for the terms in the right-hand side
In the next step, we establish an estimate for \(q_{\mathbf {k}}^{*}(f_{\mathbf {k} + \mathbf {m}})\). Denote by σ(k, s) the support of the B-spline N k,s . Then by the construction, for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), the intersection of the interiors of σ(k, s) and σ(k, s ′) is empty for different s, s ′ ∈ I ∗(k), and
Hence, we derive that
Fix a number ν > 0 such that \(\max (\frac {1}{p},\frac {1}{2}) < \nu < r\). For the last inequality, we need the following inequality
We first obtain the univariate case of this inequality which is of the form
from the inequality for every \(k \in \mathbb {Z}_{+}\),
which is the univariate case of (36). Let \(x \in \mathbb T\) and \(k \in \mathbb {Z}_{+}\) be given. Then by (35) there is a s ∈ I ∗(k) such that x ∈ σ(k,s). Notice that |x − s h (k)| ≤ 2−k. If k = 0, then by Lemma 2.3 we have
and therefore,
If k > 0, by Lemma 2.3 we have
and therefore,
Notice that for a continuous function g and a ≥ 0,
All these together give
On the other hand, if m ≥ −k, we have by Lemma 3.4 another estimate the trigonometric polynomial f k+m of degree 2k+m,
Hence, there holds the inequality
Indeed, if m < 0 and m + k ≥ 0,
Since |x − s h (k)| ≤ 2−k, we have for all m < 0,
and consequently, by (40),
which together with the equation h (k) = ℓ − 12−k and (42) proves (43) for m < 0 and m + k ≥ 0. In the case m < 0 and m + k < 0, (43) is trivial because by definition f k+m = 0. By combining (39), (41), and (43), we prove (38). The d-variate inequality (37) can be easily derived from the univariate inequality (38) by a tensor product argument.
We are now in position to estimate A m (f). Indeed, putting for \(\mathbf {m} \in \mathbb {Z}^{d}\),
from (34) and (38) and Lemmas 3.5 and 3.1 it follows that
Hence, by (34), (44) and the inequalities ℓ − r > 0 and ν − r < 0, we have
The proof is complete. □
Theorem 3.1 has been proven in [7] for the case ℓ = 2 in terms of Faber series (see Section 2.3).
3.4 Inverse Theorem of Sampling Representation
Theorem 3.2
Let 1 < p < ∞ and 0 < r < ℓ − 1. Then for every function f on \(\mathbb {T}^{d}\) represented as a B-spline series
we have \(f \in {W^{r}_{p}}\) and
whenever the right hand side is finite.
Proof
For \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\), let I ∗(k) be the subset in I(k) defined in the proof of Theorem 3.1. By the same argument as in the proof of Theorem 3.1 it is sufficient to prove that for a function f on \(\mathbb {T}^{d}\) represented as a B-spline series
we have
whenever the right-hand side is finite. Due to Lemma 3.2, the last inequality is equivalent to
Let us verify this inequality for the case e = [d] what is
The case e ≠ [d] can be proven similarly with a slight modification. For \(\mathbf {k} \in \mathbb {Z}^{d} \setminus \mathbb {Z}^{d}_{+}\), we introduce the convention: \(I^{*}(\mathbf {k}):= \varnothing \), \(q_{\mathbf {k}}^{*}:= 0\), c k,s := 0, N k,s := 0 for s ∈ I ∗(k). With this convention we can write
Put \(\mathbb {Z}^{d}(u):= \{\mathbf {m} \in \mathbb {Z}^{d}\,:\, m_{i} > 0, i \in u, m_{i} \le 0, i \not \in u \}\) for u ⊂ [d]. Notice that we have for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\),
which yields the inequality
where
For a given \(x \in \mathbb T\), we preliminarily estimate the univariate integral
Let I ∗(k + m; x) be the subset in I ∗(k + m) of all s such that |x − s2−k−m| ≤ ℓ2−k if k + m ≥ 0, and \(I^{*}(k+m;x) = \varnothing \) if k + m < 0. Then from the equation
we have
If m > 0, from the definition (19) we derive that
Notice that for k + m ≥ 0, the B-splines N k + m,s have the ℓ − 1 derivative uniformly bounded by C2(ℓ−1)(k + m) with an absolute constant C. Hence, we get for |h| ≤ 2−k,
and consequently,
Taking into account that \(q_{k+m}^{*} = 0\) for k + m < 0, and summing up we arrive at the estimate
We introduce some notations: for u ⊂ [d] and \(\mathbf {x} \in \mathbb {R}^{d} \bar {u}:= [d] \setminus u\), x(u) is the element in \(\mathbb {R}^{d}\) such that x(u) i = x i if i ∈ u and x(u) i = 0 otherwise. Then for a given \(\mathbf {x} \in \mathbb {T}^{d}\), from (48) by a tensor product argument we obtain for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\) and every \(\mathbf {m} \in \mathbb {Z}^{d}_{+}(u)\),
where \(I^{*}(\mathbf {k};\mathbf {x}):= {\prod }_{i = 1}^{d} I^{*}(k_{i};x_{i})\). By using the inequality for the univariate periodic B-splines
with an absolute constant C > 0, we can continue the estimation (49) for every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\) and every \(\mathbf {m} \in \mathbb {Z}^{d}_{+}(u)\) as
For a fixed \(x \in \mathbb T\) consider the univariate function on \(\mathbb T\) in variable y
By the construction of the set I ∗(k + m; x) and the inequality |supp(N k + m,s )| ≤ 2−k−m, we have
Hence, by the definition of the Hardy-Littlewood maximal function, we receive for every \(y \in \mathbb T\),
Let u ⊂ [d] and \(\mathbf {x} \in \mathbb {T}^{d}\) be given. We consider the function on \(\mathbb {T}^{d}\) in variable y
From (51) by a tensor product argument we can show that for every \(\mathbf {y} \in \mathbb {T}^{d}\), every \(\mathbf {k} \in \mathbb {Z}^{d}_{+}\) and every \(\mathbf {m} \in \mathbb {Z}^{d}_{+}(u)\),
and
Applying these inequalities for y = x to the right hand side in (50), by the equation \( G_{\mathbf{k}+\mathbf{m}}^{\mathbf{x}}(\mathbf{x}) \) = \( q_{\mathbf{k}+\mathbf{m}}^{*}(\mathbf{x}) \) we arrive at
which by Lemma 3.3 yields for every \(\mathbf {m} \in \mathbb {Z}^{d}_{+}(u)\),
From the last inequality and (47) taking account of the inequality ℓ − 1 − r > 0, we obtain
which proves (46) and therefore, the theorem. □
Theorem 3.2 has been proven in [7] for the case ℓ = 2 in terms of Faber series (see Section 2.3). Theorems 3.1 and 3.2 immediately yield
Theorem 3.3
Let 1 < p < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell - 1\) . Then we have
3.5 Some Theorems of Sampling Representation in Besov Spaces
Several theorems on B-spline quasi-interpolation sampling representations with discrete equivalent quasi-norm in terms of coefficient functionals have been proved in [15,16,17,18, 20] for various non-periodic Besov spaces. Let us now state some direct and inverse theorems on a quasi-interpolation representation in periodic spaces \(B_{p, \theta }^{r}\) by the B-splines series (18), which can be proven in the same way as for non-periodic Besov spaces.
Theorem 3.4
Let 0 < p,𝜃 ≤ ∞ and 1/p < r < 2ℓ . Then every function \(f \in B_{p, \theta }^{r}\) can be represented as the series (18) converging in the norm of \(B_{p, \theta }^{r}\) , and there holds the inequality
for all \(f\in B^{r}_{p,\theta }\) , with the sum over k changing to thesupremum when 𝜃 = ∞.
Theorem 3.5
Let 0 < p,𝜃 ≤ ∞ and 0 < r < min{2ℓ, 2ℓ − 1 + 1/p}. Then every function f on \(\mathbb {T}^{d}\) represented as a B-spline series (45) belongs to \(B_{p, \theta }^{r}\) and
with the sum over k changing to thesupremum when 𝜃 = ∞, whenever the right-hand side is finite.
Corollary 3.1
Let 0 < p,𝜃 ≤ ∞ and 1/p < r < min{2ℓ, 2ℓ − 1 + 1/p}. Then a periodic function \(f \in B_{p, \theta }^{r}\) can be represented by the B-spline series (18) satisfying the relation
with the sum over k changing to thesupremum when 𝜃 = ∞.
4 Sampling Recovery
For \(m \in \mathbb {Z}_{+}\), we define the operator R m by
For functions f on \(\mathbb {T}^{d}\), R m defines the linear sampling algorithm on the Smolyak grid G d(m)
where n := |G d(m)|, Y n := {y ∈ G d(m)}, \({\Phi }_{n}:= \{\varphi _{\mathbf {y}}\}_{\mathbf {y} \in G^{d}(m)}\) and for y = 2−k s, φ y are explicitly constructed as linear combinations of at most m 0 B-splines N k,j for some \(m_{0} \in \mathbb N\) which is independent of k, s, m and f.
Theorem 4.1
Let 1 < p, q < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell \) . Then we have
Proof
Let f be a function in \({W^{r}_{p}}\), since \(r > \frac {1}{p}\), f is continuous on \(\mathbb {T}^{d}\) and consequently, we obtain by Lemma 2.1
with uniform convergence.
We first consider the case p ≥ q. Due to the inequality ∥f∥ q ≤ ∥f∥ p , it is sufficient to prove this case of the theorem for p = q. From (52) and the Hölder inequality and Theorem 3.1 we have
We next consider the case p < q. From [1, Lemma 3] one can prove the inequality
Hence, by (52), Theorems 3.2 and 3.1 we derive that
The theorem is completely proven. □
Denote by \({U^{r}_{p}}\) the unit ball in the space \({W^{r}_{p}}\).
Corollary 4.1
Let 1 < p,q < ∞ and \(r > \max (\frac {1}{p},\frac {1}{2})\) . Then we have
Proof
This corollary (53) is directly derived from (7) by considering special values of n = |G d(m)|≍ 2m m d−1. □
Corollary 4.1 was proven in [32, 41] in the case p = q.
Theorem 4.2
Let 1 < p, q < ∞ and \(r > \max (\frac {1}{p},\frac {1}{2})\) . Then we have
Proof
We fix an even number ℓ = 2ν for some \(\nu \in \mathbb N\) such that r < ℓ − 1. Consider the operator R m + d ν constructed on the B-splines of order ℓ. It is a sampling algorithm on the grid G d(m). The upper bound of (54) is directly derived from (4.1) and the relations n ≍|G d(m)|≍ 2m m d−1 for the largest m such that |G d(m)| ≤ n.
To prove the lower bounds, based on the obvious inequality
we will construct test functions \(g \in {U^{r}_{p}}\) with g(y) = 0 ∀y ∈ G d(m), and then estimate from below the norm ∥g∥ q . Take the index set I ∗(k) as in (33) and consider the test function
with a constant C 1. Here, N k,s are the d-variate periodic B-splines of ℓ. By the construction one can verify that g 1(y) = 0 ∀y ∈ G d(m). By applying Theorem 3.2 and the inequality
we can see that \(g_{1} \in {U^{r}_{p}}\) for some properly chosen value of C 1. Hence, by (55)
This proves the lower bound for the case p ≥ q. For the case p < q, we take a k ∗ with |k ∗|1 = m and a s ∗ ∈ I ∗(k), and consider the test function
with a constant C 2. Similarly to the function g 1, we have g 2(y) = 0 ∀y ∈ G d(m), and \(g_{2} \in {U^{r}_{p}}\) for some properly chosen value of C 2. Hence, by (55) we obtain
which proves the lower bound for the case p < q. □
From Theorem 4.1 and the proof of the lower bounds in Theorem 4.2, we also obtain
Corollary 4.2
Let 1 < p,q < ∞ and \(\max (\frac {1}{p},\frac {1}{2}) < r < \ell \) . Then we have
Theorem 4.3
Let 1 < p < ∞ and 1/p < r < ℓ . Then we have
Proof
The upper bound follows from the embedding \({W^{r}_{p}} \hookrightarrow B^{r-1/p}_{\infty ,p}\) [29] (see also [19, Lemma 3.7]) and the estimate
proven in [17, Theorem 3.1], where \(U^{r-1/p}_{\infty ,p}\) is the unit ball in \(B^{r-1/p}_{\infty ,p}\). The lower bound can be proven in a similar way to that of [38, Theorem 2.1]. □
Theorem 4.4
Let 1 < p < q ≤ 2or 2 ≤ p < q < ∞ and \(r > \max (\frac {1}{p},\frac {1}{2})\) . Then we have
Proof
The upper bound of (56) already is in Corollary 4.1. To prove the lower bound we compare the sampling width with the well known linear width which is defined by
where the infimum is taken over all linear operators Λ n of rank n in the normed space L q . The lower bound follows from the inequality \( r_{n}({U^{r}_{p}},L_{q}) \ge \lambda _{n}({U^{r}_{p}},L_{q}) \) and the inequality
proven in [22] (see also [23]). □
Theorem 4.4 has been proven in [5] for the case 2 = p < q ≤ ∞.
Final Remarks
All the results in this paper can be in a natural way extended to the Sobolev space \( W_{p}^{\mathbf{r}} \) and the class \( U_{p}^{\mathbf{r}} \) of nonuniform mixed smoothness r with r = r 1 = ⋯ = r ν < r ν+1 ≤ r ν+2 ≤ ⋯ ≤ r d by using the same methods and techniques. In particular, the direct and inverse Littlewood-Paley-type theorems of B-spline sampling representation for the space \(W^{\mathbf {r}}_{p}\) hold true, and in the results on asymptotic orders, upper and lower bounds of \({r^{s}_{n}}(U^{\mathbf {r}}_{p},L_{q})\) and \(r_{n}(U^{\mathbf {r}}_{p},L_{q})\) the number d is replaced by ν.
The direct and inverse theorems of B-spline sampling representation and the results on sampling recovery for Sobolev spaces of mixed smoothness in Section 3 can be also easily extended to Triebel-Lizorkin spaces of mixed smoothness. In this way, one can replace the smoothness restriction \(r > \max (\frac {1}{p},\frac {1}{2})\) in Theorems 4.1, 4.2, 4.4 and their following corollaries with the weaker restriction r > 1/p in the Sobolev context.
References
Besov, O.V.: Multiplicative estimates for integral norms of differentiable functions of several variables. Proc. Steklov Inst. Math. 131, 1–14 (1974)
Besov, O.V., Il’in, V.P., Nikol’skii, S.M.: Integral Representations of Functions and Imbedding Theorems, vol. 1. Halsted Press, New York (1978)
Bokanowski, O., Garcke, J., Griebel, M., Klompmaker, I.: An adaptive sparse grid semi-Lagrangian scheme for first order Hamilton-Jacobi Bellman equations. J. Sci. Comput. 55(3), 575–605 (2013)
Bungartz, H.-J., Griebel, M.: Sparse grids. Acta Numer. 13, 147–269 (2004)
Byrenheid, G., Dũng, D., Sickel, W., Ullrich, T.: Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in H γ. J. Approx. Theory 207, 207–231 (2016)
Byrenheid, G., Ullrich, T.: Optimal sampling recovery of mixed order Sobolev embeddings via discrete Littlewood–Paley type characterizations. arXiv:1603.04809 (2016)
Byrenheid, G., Ullrich, T.: The Faber-Schauder system in spaces with bounded mixed derivative and nonlinear approximation. Manuscript (2016)
Chui, C.K.: An Introduction to Wavelets. Academic Press, New York (1992)
de Bore, C., Höllig, K., Riemenschneider, S.: Box Spline. Springer, Berlin (1993)
Dũng, D.: On recovery and one-sided approximation of periodic functions of several variables. Dokl. Akad. SSSR 313, 787–790 (1990)
Dũng, D.: On optimal recovery of multivariate periodic functions. In: Igary, S. (ed.) Harmonic Analysis (Conference Proceedings), pp. 96–105. Springer, Tokyo-Berlin (1991)
Dũng, D.: Optimal recovery of functions of a certain mixed smoothness. Vietnam J. Math. 20(2), 18–32 (1992)
Dũng, D.: Continuous algorithms in n-term approximation and non-linear widths. J. Approx. Theory. 102, 217–242 (2000)
Dũng, D.: Non-linear approximations using sets of finite cardinality or finite pseudo-dimension. J. Complex. 17, 467–492 (2001)
Dũng, D.: Non-linear sampling recovery based on quasi-interpolant wavelet representations. Adv. Comput. Math. 30, 375–401 (2009)
Dũng, D.: Optimal adaptive sampling recovery. Adv. Comput. Math. 34, 1–41 (2011)
Dũng, D.: B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness. J. Complex. 27, 541–467 (2011)
Dũng, D.: Sampling and cubature on sparse grids based on a B-spline quasi-interpolation. Found. Comp. Math. 16, 1193–1240 (2016)
Dũng, D., Temlyakov, V.N., Ullrich, T.: Hyperbolic cross approximation. arXiv:1601.03978[math.NA] (2015)
Dũng, D., Ullrich, T.: Lower bounds for the integration error for multivariate functions with mixed smoothness and optimal Fibonacci cubature for functions on the square. Math. Nachr. 288, 743–762 (2015)
Fefferman, C., Stein, E.M.: Some maximal inequalities. Am. J. Math. 93, 107–115 (1972)
Galeev, E.M.: On linear widths of classes of periodic functions of several variables. Vestnik MGU Ser.1 Mat.-Mekh. 4, 13–16 (1987)
Galeev, E.M.: Linear widths of Hölder-Nikol’skii classes of periodic functions of several variables. Mat. Zametki 59, 189–199 (1996)
Garcke, J., Hegland, M.: Fitting multidimensional data using gradient penalties and the sparse grid combination technique. Computing 84(1-2), 1–25 (2009)
Gerstner, T., Griebel, M.: Sparse grids. In: Cont, R. (ed.) Encyclopedia of Quantitative Finance. Wiley, New York (2010)
Griebel, M., Harbrecht, H.: A note on the construction of L-fold sparse tensor product spaces. Constr. Approx. 38(2), 235–251 (2013)
Griebel, M., Holtz, M.: Dimension-wise integration of high-dimensional functions with applications to finance. J. Complex. 26, 455–489 (2010)
Griebel, M., Harbrecht, H.: On the construction of sparse tensor product spaces. Math. Comput. 82(282), 975–994 (2013)
Jawerth, B.: Some observations on Besov and Lizorkin-Triebel spaces. Math. Scand. 40(1), 94–104 (1977)
Griebel, M., Knapek, S.: Optimized general sparse grid approximation spaces for operator equations. Math. Comp. 78(268), 2223–2257 (2009)
Nikol’skaya, N.: Approximation of periodic functions in the class \(SH^{r}_{p}*\) by Fourier sums. Sibirsk. Mat. Zh. 16, 761–780 (1975). English transl. in Siberian Math. J. 16, 1975
Sickel, W., Ullrich, T.: The Smolyak algorithm, sampling on sparse grids and function spaces of dominating mixed smoothness. East J. Approx. 13, 387–425 (2007)
Sickel, W., Ullrich, T.: Spline interpolation on sparse grids. Appl. Anal. 90, 337–383 (2011)
Schmeisser, H.J., Triebel, H.: Topics in Fourier Analysis and Function Spaces. Wiley, New York (1987)
Smolyak, S.A.: Quadrature and interpolation formulas for tensor products of certain classes of functions. Dokl. Akad. Nauk 148, 1042–1045 (1963)
Temlyakov, V.: Approximation recovery of periodic functions of several variables. Mat. Sb. 128, 256–268 (1985)
Temlyakov, V.N.: Approximation of periodic functions of several variables by trigonometric polynomials, and widths of some classes of functions. Izv. AN SSSR 49, 986–1030 (1985). English Transl. in Math. Izv. 27, 1986
Temlyakov, V.: On approximate recovery of functions with bounded mixed derivative. J. Complex. 9, 41–59 (1993)
Temlyakov, V.: Approximation of Periodic Functions. Nova Science Publishers, New York (1993)
Triebel, H.: Bases in Function Spaces, Sampling, Discrepancy, Numerical Integration. European Math. Soc. Publishing House, Zürich (2010)
Ullrich, T.: Smolyak’s algorithm, sampling on sparse grids and Sobolev spaces of dominating mixed smoothness. East J. Approx. 14, 1–38 (2008)
Ullrich, T.: Function spaces with dominating mixed smoothness, characterization by differences. Technical report, Jenaer Schriften zur Math. und Inform. Math/inf/05/06 (2006)
Zenger, C.: Sparse grids. In: Hackbusch, W. (ed.) Parallel Algorithms for Partial Differential Equations, vol. 31 of Notes on Numerical Fluid Mechanics, Vieweg, Braunschweig/Wiesbaden (1991)
Acknowledgements
This work is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant No. 102.01-2017.05. A part of this work was done when the author was working as a research professor at the Vietnam Institute for Advanced Study in Mathematics (VIASM). He would like to thank the VIASM for providing a fruitful research environment and working condition. The author would like to thank Glenn Byrenheid and Tino Ullrich for giving opportunity to read the manuscript [7]. He thanks Glenn Byrenheid, Vladimir Temlyakov, and Tino Ullrich for useful discussions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dũng, D. B-Spline Quasi-Interpolation Sampling Representation and Sampling Recovery in Sobolev Spaces of Mixed Smoothness. Acta Math Vietnam 43, 83–110 (2018). https://doi.org/10.1007/s40306-017-0230-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40306-017-0230-3
Keywords
- Sampling width
- Linear sampling algorithms
- Smolyak grids
- Sobolev spaces of mixed smoothness
- B-spline quasi-interpolation sampling representations
- Littlewood-Paley-type theorem