Approximation of Non-Decaying Signals From Shift-Invariant Subspaces
Ha Q. Nguyen, Michael Unser

TL;DR
This paper extends the Strang-Fix theory to show that non-decaying signals in weighted-$L_p$ spaces can be approximated with error decreasing as $O(h^L)$, using shift-invariant spaces and specific kernel conditions.
Contribution
It introduces a generalized approximation error decay rate for non-decaying signals, extending classical theory to weighted spaces and providing conditions for both projection and interpolation schemes.
Findings
Error decays as $O(h^L)$ with decreasing sampling step h.
Approximation is stable under specific kernel and signal smoothness conditions.
Both projection and interpolation methods achieve the decay, with interpolation requiring more signal smoothness.
Abstract
In our recent work, the sampling and reconstruction of non-decaying signals, modeled as members of weighted- spaces, were shown to be stable with an appropriate choice of the generating kernel for the shift-invariant reconstruction space. In this paper, we extend the Strang-Fix theory to show that, for -dimensional signals whose derivatives up to order are all in some weighted- space, the weighted norm of the approximation error can be made to go down as when the sampling step tends to . The sufficient condition for this decay rate is that the generating kernel belongs to a particular hybrid-norm space and satisfies the Strang-Fix conditions of order . We show that the behavior of the error is attainable for both approximation schemes using projection (when the signal is prefiltered with the dual kernel) and interpolation (when a prefilter isâŠ
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Approximation of Non-Decaying Signals From Shift-Invariant Subspaces111This research was funded by the European Research Council under
the European Unionâs Seventh Framework Programme (FP7/2007-2013) / ERC Grant Agreement No. 267439 and the Swiss National Science Foundation under Grant 200020-162343.
Ha Q. Nguyen
Michael Unser
Biomedical Imaging Group, Ăcole Polytechnique FĂ©dĂ©rale de Lausanne (EPFL), Station 17, CH-1015, Lausanne, Switzerland
Abstract
In our recent work, the sampling and reconstruction of non-decaying signals, modeled as members of weighted- spaces, were shown to be stable with an appropriate choice of the generating kernel for the shift-invariant reconstruction space. In this paper, we extend the Strang-Fix theory to show that, for -dimensional signals whose derivatives up to order are all in some weighted- space, the weighted norm of the approximation error can be made to go down as when the sampling step tends to [math]. The sufficient condition for this decay rate is that the generating kernel belongs to a particular hybrid-norm space and satisfies the Strang-Fix conditions of order . We show that the behavior of the error is attainable for both approximation schemes using projection (when the signal is prefiltered with the dual kernel) and interpolation (when a prefilter is unavailable). The requirement on the signal for the interpolation method, however, is slightly more stringent than that of the projection because we need to increase the smoothness of the signal by a margin of , for arbitrary . This extra amount of derivatives is used to make sure that the direct sampling is stable.
keywords:
approximation theory, Strang-Fix conditions, shift-invariant spaces, spline interpolation, weighted spaces, weighted Sobolev spaces, hybrid-norm spaces
â â journal: Applied and Computational Harmonic Analysis
1 Introduction
Sampling and reconstruction are important in signal processing because they provide an insightful connection between analog signals and their discrete representations. In the sampling procedure, oftentimes, a continuous-domain signal is uniformly sampled (with or without a prefilter) at multi-integer multiples of some sampling step to produce a discrete-domain signal . The reconstruction, on the other hand, is commonly done by interpolating the samples with scaled and shifted copies of some kernel (generating function) positioned on the grid . Precisely, the reconstructed signal takes the (integer) shift-invariant form
[TABLE]
This interpolation model has been extensively used in the theory of splines [1, 2, 3, 4]. It is general enough to include the celebrated reconstruction formula in Shannonâs sampling theorem [5] in which the kernel is replaced with the sinc function. Although the sinc-based interpolation guarantees exact recovery of bandlimited signals (or signals prefiltered with an ideal lowpass filter) whenever exceeds Nyquistâs rate, the slow decay of sinc unfortunately prevents the application of this method in practice [6]. For other choices of with better localization properties, such as splines, exact reconstruction is no longer achievable but the quality of the approximation of a signal by such given in (1) can be characterized as a power of the sampling step via the Strang-Fix theory. Specifically, in early 1970âs, Strang and Fix [7] extended Schoenbergâs work [1] and introduced the concept of controlled approximation in which the -norm of the sampled coefficients is bounded by the -norm of the original signal. They showed that, for compactly supported , the error of the controlled approximation is bound as
[TABLE]
if and only if satisfies the Strang-Fix conditions of order so that the representation (1) is able to reproduce all polynomials of degree less than ; this notion will be clarified later in Section 2.4. Here, is the th derivative222To be precise, when is multivariate, is the summation of (the moduli of) all partial derivatives of order of . of and is the Sobolev space of functions whose first derivatives are all in . The order in (2) is referred to in the literature as the order (power) of approximation.
The original result of Strang and Fix has been extended in various directions, including controlled -approximation with globally supported (multi-) kernel [8, 9, 10, 11], uncontrolled -approximation [12], and finer estimations of the -approximation error [13, 14, 15, 16, 17]; interested readers are also referred to the surveys [18, 19, 20]. More recently, the Strang-Fix theory was linked to the sampling of signals with finite rate of innovation [21]. Despite a rich literature on the Strang-Fix conditions, none of the existing results allows us to deal with the approximation of non-decaying (non-) signals, such as sample paths of a Brownian motion, which can even grow at infinity. This is an important part that seems to be missing in the theory of sparse stochastic processes recently developed by Unser et al. [22, 23, 24].
In this paper, a follow-up of our recent works on the sampling theory for non-decaying signals [25, 26, 27], we provide an approximation theory for such objects. Recall that we showed in [25] that both the sampling and reconstruction of weighted- signals, at a fixed sampling step, are stable, provided the generating kernel lies in an appropriate hybrid-norm space, a concept closely related to the Wiener amalgams that are frequently used in time-frequency analysis [28, 29, 30]. Note that, in the direct sampling scheme, where a prefilter is absent, not only the signal is required to live in a weighted- space, but also its first derivatives, for some . In the spirit of [25], we model non-decaying signals in this paper as members of the weighted space associated with the Sobolev weight , where specifies the order of growth of the signals. In particular, if . We then extend the classical Strang-Fix theory to the approximation of such signals for the two common types of shift-invariant reconstructions: projection versus (direct) interpolation.
In the projection scheme, which provides the optimal -approximation, the original signal is prefiltered with the dual kernel  [14] and the coefficients in (1) are obtained by sampling the resulting signal with step size . It means that the reconstructed signal is given by
[TABLE]
For this type of reconstruction, we show, in the first half of the paper, that if belongs to an appropriate hybrid-norm space and at the same time satisfies the Strang-Fix conditions of order , then the weighted- norm of the projection error is bounded as
[TABLE]
where the weighted Sobolev space is a collection of functions whose derivatives up to order are all in . We want to remark that this result is the weighted version of [11, Theorem 2.2].
In the interpolation scheme, the coefficients are sampled directly from the original signal; hence the reconstructed signal takes the form
[TABLE]
where is the interpolant generated from the kernel  [6]. Similar to the projection case, we establish, in the second half of the paper, that if is an element of a particular hybrid-norm space that satisfies the Strang-Fix condition of order , then, given ,
[TABLE]
Here, is a combination of all fractional derivatives up to order of defined in the frequency domain as with being the Fourier transform operator. Informally speaking, the interpolation error can also be made to decay like , when tends to [math], for functions whose derivatives up to order live in some weighted- space, for arbitrary . This is not surprising because we need derivatives to take care of the sampling, as indicated in [25], and derivatives more to reach the target approximation order. To the best of our knowledge, the bound (4) is new even in the unweighted case (when all instances of the subscript disappear), although similar results exist for the direct interpolation in  [14] and  [9]. The (unweighted) result presented in [10, Theorem 4.1], although similar to (4), does not fall into the realm of direct interpolation because the samples are taken from a smoothed version of the original signal.
One of the challenges for the approximation in weighted spaces is that the beautiful Fourier-based methods commonly used in the Strang-Fix theory [7, 12, 13, 14, 15, 16, 17] are no longer applicable, even in the weighted- case, due to the lack of a Parseval-type relation. In proving the bounds (3) and (4), we adapt the -approximation techniques in [10, 11], which are carried entirely in the space domain, but our analysis is much more involved because of the handling of the weights. We also heavily rely on the preliminary results in [25]. Other works that are closely related to the present paper are [31, 32] in which similar bounds were derived in the weighted- spaces associated with the so-called Muckenhoupt weights [33]. These weights, however, are strikingly different from the Sobolev weights used in this paper. They are characterized by the boundedness of the Hardy-Littlewood maximal operator [34, 35, 36] with respect to the weighted norm. Typical examples of the Muckenhoupt weights are , for being restricted in the interval (cf. [37]). By contrast, the Sobolev weights can take arbitrary order and therefore give us more freedom in quantifying the growth or decay of the signals. Moreover, the Muckenhoupt weights are not well-suited to time-frequency analysis because they are generally not submultiplicative, an important property that is satisfied by the Sobolev weights (cf. [38, Section 9]).
The remainder of the paper is organized as follows: preliminary notions are introduced in Section 2; approximation error bounds for the projection and interpolation paradigms are derived in Sections 3 and 4, respectively; proofs of several auxiliary results are given in Section 5.
2 Preliminaries
2.1 Notation
All functions in this paper are mappings from to for a fixed dimension . Vectors in are denoted by bold letters and their Euclidean norms are denoted by . The constants throughout the paper are denoted by with subscripts indicating the dependence of the constants on some parameters; we use the same notation for different constants that depend on the same set of parameters. The restriction of a function on the multi-integer grid is denoted by . is the set of natural numbers starting from zero and is the set of positive integers, i.e., . For brevity, we denote by the Sobolev weighting function . For , we use to denote the Hölder conjugate of that satisfies .
is the space of smooth and compactly supported functions, is Schwartzâ class of smooth and rapidly decaying functions, and is the space of tempered distributions, which are continuous linear functionals on . As usual, the notation is used interchangeably for the scalar product and for the action of a distribution on a test function. The (distributional) Fourier transform of a tempered distribution is also a tempered distribution defined as
[TABLE]
where
[TABLE]
We denote the inverse Fourier-transform operator by . For a multi-index , and is a shorthand for . The (distributional) partial derivative with respect to of a tempered distribution is also a tempered distribution defined as
[TABLE]
We also use the notation
[TABLE]
is the gradient operator and is the directional derivative operator with respect to . The shift and difference operators are defined as and , respectively. For , denotes the scaling operator given by .
2.2 Weighted Normed Spaces
The spaces and and their corresponding norms and are defined as usual. We also need the hybrid-norm space which comprises all functions whose hybrid (mixed) norm
[TABLE]
is finite. For any weighting function , the weighted spaces , and are defined with respect to the following weighted norms:
[TABLE]
When , for some , we write for , for , and for . Note that, for , the weight is (weakly) submultiplicative, i.e.,
[TABLE]
which is equivalent to
[TABLE]
Furthermore, the weight satisfies the Gelfand-Raikov-Shilov condition [39] that
[TABLE]
These two properties of , with , will be crucial for us to manipulate weights.
Finally, let us define the weighted Sobolev spaces of integer and fractional orders. Given and , the space with consists of all such that
[TABLE]
It is straightforward that if then , for all . Meanwhile, the space with consists of all such that
[TABLE]
From here on, the term will be abbreviated as . When , is the Bessel potential of order  [40]. We also need the hybrid weighted Sobolev space which encompasses all such that . Note that, in the unweighted case (), it is not difficult to show that , for , using the Mikhlin-Hörmander theorem on Fourier multipliers (cf. [41, Chapter 5] and [40, Chapter 6]). For , however, is not necessarily the same as . This is due to the lack of a theory on weighted Fourier multipliers for the Sobolev weights; most of the existing literature are concerned with the Muckenhoupt weights, instead [37, 42, 43].
2.3 Shift-Invariant Spaces of Non-Decaying Functions
We are interested in the approximation of a non-decaying function living in the ambient space , for some , by an element in the (weighted) shift-invariant space generated by some kernel defined as
[TABLE]
where is a varying scale (sampling step). We write for , write for , and write for . In addition to including many types of signal reconstruction models covered in the literature [6], this general formulation allows us to deal with (polynomially) growing signals. Similar to the unweighted case, we want to make sure that the (unscaled) space is a closed subspace of and each of its member has an unambiguous representation in terms of the coefficients . It turns out that, as shown in [25, Theorem 2], this wish list will be fulfilled if the generating kernel satisfies the following admissibility conditions:
- (i)
is a Riesz basis for or, equivalently, the Fourier tranform of the autocorrelation sequence, , is bounded from below and above for almost all ;
- (ii)
belongs to the weighted hybrid-norm space with .
We want to emphasize that the above conditions, though mathematically cumbersome, are by no means restrictive since they are easily satisfied by all interpolation kernels used in practice, and in particular B-splines [6].
2.4 Strang-Fix Conditions
There are multiple forms of the Strang-Fix conditions; the equivalence between them was initially shown for compactly supported functions [7] but then extended to kernels with global supports [9, 10]. The most common form of the Strang-Fix conditions is characterized in the frequency domain: a kernel is said to satisfy the Strang-Fix conditions of order if its Fourier transform satisfies
- (i)
and
- (ii)
.
These conditions are equivalent to the existence of a quasi-interpolant of order  [44, 45, 46] in the shift-invariant subspace . This quasi-interpolant exactly interpolates all polynomials of degree (strictly) less than , i.e.
[TABLE]
where stands for . Therefore, the Strang-Fix conditions of order can also be described as the ability of the space to reproduce polynomials of degree less than . It is important to note that, for a particular , there are multiple choices for the quasi-interpolant within the subspace , one of which is the interpolant that satisfies not only (5) but also the interpolating property
[TABLE]
where denote the discrete unit impulse; the construction of this interpolant will be discussed in Section 4.
Most importantly, the Strang-Fix conditions of order are necessary and sufficient for the controlled -approximation of order that for any , there exists in such that
- (i)
and
- (ii)
, as ,
where the constants are independent of . Note that the controllability of the approximation is dictated by the first bound, whereas the order of the approximation is described by the second bound. This beautiful connection between the approximation of order and the ability of the representation space to reproduce polynomials of degree less than lies at the core of the Strang-Fix theory and its various extensions [10, 12, 15]. Finally, it is handy to keep in mind that the B-spline of order  [47, 48] satisfies the Strang-Fix conditions of order .
3 Projection Error Bound
In this section, we derive the error bound for the approximation of a non-decaying function in the weighted Sobolev space by its projection onto the shift-invariant space . Assume throughout this section that the kernel is such that is a Riesz basis for . This condition guarantees [6] that the dual kernel exists and is given in the Fourier domain by
[TABLE]
Let us define the operator
[TABLE]
where, for each , the coefficient is given by
[TABLE]
In the language of signal processing, is the result of prefiltering the signal with the filter followed by a sampling at location . We write for . It is well known in the (unweighted) case that is an orthogonal projector from onto the subspace and therefore provides the best -approximation. In the weighted- setup, orthogonality no longer exists but the operator still behaves properly. In particular, the following result shows that is a bounded projector from onto whose norm is bounded as the scale tends to [math]. The essential condition for that to hold true is that the generating kernel is a member of an appropriate weighted hybrid-norm space.
Theorem 1**.**
Let and . If with and is a Riesz basis for , then, for all , is a closed subspace of and is a projector from onto . Furthermore, there exists a constant such that
[TABLE]
Proof.
Since and is a Riesz basis for , it is known from [25, Theorems 1 & 2] that is a closed subspace of and is a bounded projector from onto . We now divide the rest of the proof into several steps.
First, we show that is a subspace of , for all . Given , it is clear that . On the other hand,
[TABLE]
This implies that also belongs to , or is a subspace of , for all .
Second, we show that is closed under the norm of , for all . Let be a sequence in such that in as . Similar to (8), we have that
[TABLE]
which implies that in as . As is a sequence in , it follows from the closedness of that , or . This shows the closedness of .
Third, we show that is a projector that maps to , for all . Observe that . From (8), maps to itself. It is also known that maps to and maps to . Therefore, maps to . The idempotence of can be easily verified as
[TABLE]
where we have relied on the idempotence of the projector .
Finally, we show the bound (7). Let us consider the weighting function . It is easy to see that satisfies
[TABLE]
By a change of variable and from the last bound in the proof of [25, Theorem 1], we have that, for all ,
[TABLE]
where is precisely the constant in (9) that does not depend on . On the other hand, according to [25, Proposition 6], both and are elements of . Since , it must be that and . Moreover, the assumption that gives
[TABLE]
and
[TABLE]
Putting together (10), (11), and (12) yields the desired bound (7). â
The main result of this section is as follows:
Theorem 2**.**
Let , , and . Assume that with and that is a Riesz basis for . Assume also that satisfies the Strang-Fix conditions of order . Then, there exist a constant such that, for all ,
[TABLE]
when .
In what follows, we break the proof of Theorem 2 into several small results. Let us begin by defining the smoothing operator as
[TABLE]
with some underlying function such that and . This smoothing operator was also exploited in [10, 11].
Expanding as
[TABLE]
we obtain
[TABLE]
Therefore, can also be expressed as
[TABLE]
This means that is a convolution operator: , where
[TABLE]
The following result shows that the weighted norm of the error between a function and its smoothed version is as tends to [math].
Proposition 1**.**
For , , , and being the smoothing operator defined in (14), there exists a constant such that, for all and for all ,
[TABLE]
Proof.
We first need the following two lemmas whose proofs can be found in Section 5.
Lemma 1**.**
Let and let be the (1-D) B-spline of order given by the -fold convolution
[TABLE]
where
[TABLE]
Then, for all , one has
[TABLE]
Lemma 2**.**
Let and . If such that its partial derivatives up to order are locally integrable functions, then
[TABLE]
where .
We remark that Lemma 1 is an extension of Peanoâs theorem [49, page 70] for smooth functions. It is needed to avoid the density argument in the proof of [10, Theorem 3.3] that is unavailable in the weighted case. Let us continue with the proof of Proposition 1. Observe that
[TABLE]
From Lemma 1 and by taking into account the fact that and , we write
[TABLE]
It then follows from Minkowskiâs inequality and Lemma 2 that
[TABLE]
On the other hand,
[TABLE]
Thus, for and ,
[TABLE]
Combining (20) with (19) leads to
[TABLE]
which completes the proof. â
Proposition 2**.**
Assume that , , and . Let and let be the smoothing operator defined in (14). If is an element of that satisfies the Strang-Fix conditions of order , then there exists a constant such that, for all and for all ,
[TABLE]
Proof.
We begin the proof with a lemma; its proof is given in Section 5.
Lemma 3**.**
Let , . Then, there exists a constant such that, for all and for all ,
[TABLE]
Let us now put and . It is clear that is infinitely differentiable. For , let denote the remainder of the order- Taylor series of function about . Since satisfies the Strang-Fix conditions of order , it is known [14] that maps every polynomial of degree less than to itself. Therefore, it is possible to write
[TABLE]
where the sequence is given by
[TABLE]
The weighted- norm of the projection error is then bounded as
[TABLE]
The last estimate is due to a change of variable and to the fact that , , . Let us define the two sequences: and , for each and each . Plugging these notations into (24) and applying Minkowskiâs inequality, we obtain
[TABLE]
We now proceed to bound the quantity . By Taylorâs theorem
[TABLE]
where the operator is defined as
[TABLE]
Note that the swapping of and in (26) is justified because is a convolution operator and hence commutes with differential and shift operators. From (23) and the definition of , one has
[TABLE]
where . By Minkowskiâs inequality and by Lemma 3
[TABLE]
On the other hand
[TABLE]
where (30) follows from Lemma 2; (31) is due to the submultiplicativity of the weight ; and (32) is because and . Putting (29) and (33) together
[TABLE]
The last estimate is again due to the submultiplicativity of the weight .
Since , it follows from [25, Proposition 6] that also belongs to . Since , it must be that and so the right-hand side of (34) is finite. Plugging (34) into (25) yields
[TABLE]
which is the desired bound. â
With the above results in hands, we are now ready to prove Theorem 2.
Proof of Theorem 2.
Without loss of generality, assume that . Put . By using the triangle inequality and by applying Theorem 1, we have that
[TABLE]
This bound together with Propositions 1 and 2 immediately implies (13), completing the proof. â
4 Interpolation Error Bound
We consider in this section the approximation scheme in which a function is ideally sampled (without a prefilter) and reconstructed using an interpolating kernel. The interpolation operator associated with kernel and sampling step is defined by
[TABLE]
where the interpolant is related to the kernel by
[TABLE]
and where the discrete filter is given in the Fourier domain by
[TABLE]
This filter is to make sure that , for all . We have assumed implicitly in (37) that is nonzero for almost all . It is noteworthy that, in the absence of a prefilter, the function to be approximated has to be continuous everywhere for the sampling to make sense.
Another way to express (35) is
[TABLE]
where is the sampled sequence of discretely filtered by . We write for .
The following lemma says that the interpolant and the kernel can be made to lie in the same weighted hybrid-norm space by imposing on some mild conditions that are satisfied by, for example, B-splines of all orders.
Lemma 4**.**
Let and . Let such that and is nonzero for almost all . Then, the corresponding interpolant defined in (36) also belongs to .
Proof.
Section 5 â
The next result is the interpolation counterpart of Theorem 1 and can be thought of as the scaled version of [25, Proposition 9]. It asserts that is a bounded operator from to whose norm is bounded as . The underlying condition is that the interpolant belongs to the weighted hybrid-norm space .
Theorem 3**.**
Assume that , , and . Let such that and is nonzero for almost all . Then, there exists a constant such that, for all continuous functions and for all ,
[TABLE]
Proof.
Let be the kernel associated with the Bessel potential of order . Recall from [40, Proposition 6.1.5] that , for all , and that
[TABLE]
Moreover, since , it is also known [25, Proposition 7] that .
Let us now define the weight . Recall that is submultiplicative with the same constant for all . Observe from (35) that . Therefore, by a change of variable, we have
[TABLE]
We now invoke [25, Proposition 4] to get
[TABLE]
Note that, for all , , and so, the quantity is bounded since
[TABLE]
which is finite due to Lemma 4. On the other hand, since , we can write
[TABLE]
and apply [25, Proposition 5] to obtain
[TABLE]
where (44) is due to a change of variable and the definition of the Sobolev norm . Combining (41), (42), (43), and (44), we arrive at
[TABLE]
Hence, the desired bound (39) will be achieved if
[TABLE]
for some constant . In the rest of the proof, we will show that this claim is true. Let us put , , and . From the positivity of , it is clear that , . By the definition of the mixed norm, we express
[TABLE]
Applying Minkowskiâs inequality, we get
[TABLE]
where is a subset of defined by
[TABLE]
We complete the proof by showing that both terms and in (47) are bounded by . It is clear that , for some constant . Therefore, by Hölderâs inequality
[TABLE]
The constant in (48) is finite because . We now proceed to bound the term in (47). As , we have that, for all and for all ,
[TABLE]
which, according to (40), implies that
[TABLE]
Plugging this bound into the formula of and using the submultiplicativity of the weight and the fact that , we get
[TABLE]
Since the integral in (49) is a constant independent of , we only need to show that the sum is bounded by . Again, by the submultiplicativity of the weight and by the assumption that , we have
[TABLE]
which implies
[TABLE]
Combining this with (49) yields that which, together with (48), establishes the claim (46) and therefore completes the proof. â
In the rest of this section, we state and prove the interpolation counterpart of Theorem 2.
Theorem 4**.**
Assume that , , , and . Let be an element of that satisfies the Strang-Fix conditions of order . Assume also that and is nonzero for almost all . Then, there exists a constant such that, for all continuous functions in ,
[TABLE]
when .
Similar to the proof of Theorem 2, we divide the proof of Theorem 4 into two propositions.
Proposition 3**.**
For , , , , and being the smoothing operator defined in (14), there exists a constant such that, for all and for all ,
[TABLE]
Proof.
Put . Since is a convolution operator, we have the expression
[TABLE]
Hence
[TABLE]
We now apply Proposition 1 to to obtain
[TABLE]
Putting (51) and (52) together completes the proof.
â
Proposition 4**.**
Assume that , , , and . Let be the smoothing operator defined in (14). If satisfies the conditions of Theorem 4, there exists a constant such that, for all and for all ,
[TABLE]
Proof.
We first show that . Indeed, since , where , we have the estimate
[TABLE]
where (54) is a consequence of weighted Youngâs inequality. On the other hand, it was shown in [25, Proposition 7] that , for . This means that the constant in (55) is finite, which then implies that .
Let be the remainder of the order-() Taylor series of the infinitely differentiable function about . Since is a quasi-interpolant of order , maps every polynomial of order less than to itself. Following the path of the proof of Proposition 2, we write
[TABLE]
where the sequence is redefined as
[TABLE]
Therefore, (25) still holds and we only need to estimate , where
[TABLE]
Similarly to (26), we express
[TABLE]
where the operator is given in (27). Repeating the manipulations in the proof of Proposition 2, we obtain the counterpart of (34):
[TABLE]
Substituting this bound into (25), we end up with
[TABLE]
where is a finite constant thanks to Lemma 4. Combining (56) and (55) gives us the desired bound (53). â
Proof of Theorem 4.
Without loss of generality, assume that . Let . By the triangle inequality
[TABLE]
From Theorem 3 and Propositions 3, the first two terms in the right-hand side of (57) are bounded as
[TABLE]
whereas the third term is also bounded, according to Proposition 4, as
[TABLE]
Finally, the desired bound (50) is obtained by combining (57), (58) and (59).
â
5 Proofs of Auxiliary Results
5.1 Proof of Lemma 1
It is clear that
[TABLE]
On the other hand, the Fourier transform of the B-spline is given by [47]
[TABLE]
Therefore, the Fourier transform of the right-hand side (RHS) of (17) is given by
[TABLE]
which is exactly the Fourier transform of the left-hand side of (17), completing the proof.
5.2 Proof of Lemma 2
The claim is trivial for . We now show (18) based on the induction hypothesis that
[TABLE]
By definition of directional derivatives, we have that
[TABLE]
It then follows from (60) that
[TABLE]
completing the proof.
5.3 Proof of Lemma 3
It is clear from the definition of that . Then, we write
[TABLE]
where the kernel is given by
[TABLE]
Since is a compactly supported smooth function, it is easy to see that the kernel given above is an element of the hybrid-norm space , which is clearly a subspace of . Then, the convolution expression in (61) allows us to invoke [25, Proposition 5] to obtain
[TABLE]
where (62) is due to the assumption that and (63) is the result of a change of variable. Putting gives us the desired bound (21).
5.4 Proof of Lemma 4
Recall that, for , the weight is submultiplicative and satisfies the Gelfand-Raikov-Shilov condition. Since and since is nonzero for almost all , we are allowed to invoke the weighted version of Wienerâs lemma [38, Theorem 6.2] to deduce that the sequence defined in (37) also belongs to . Now that has the representation (36) with and , it must be that as a consequence of [25, Lemma 1].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. J. Schoenberg, âContributions to the problem of approximation of equidistant data by analytic functions,â Quart. Appl. Math. , vol. 4, pp. 45â99, 112â141, 1946.
- 2[2] ââ, Cardinal Spline Interpolation . Philadelphia, PA: Society of Industrial and Applied Mathematics, 1973.
- 3[3] C. de Boor, A Practical Guide to Splines . New York, NY: Springer-Verlag, 1978.
- 4[4] L. L. Schumaker, Spline Functions: Basic Theory . New York, NY: Wiley, 1981.
- 5[5] C. E. Shannon, âCommunication in the presence of noise,â Proc. IRE , vol. 37, no. 1, pp. 10â21, Jan. 1949.
- 6[6] M. Unser, âSamplingâ50 years after Shannon,â Proc. IEEE , vol. 88, no. 4, pp. 569â587, Apr. 2000.
- 7[7] G. Strang and G. Fix, âA Fourier analysis of the finite element variational method,â in Constructive Aspects of Functional Analysis , G. Geymonat, Ed. Rome, Italy: Springer, 1971, pp. 796â830.
- 8[8] C. de Boor and R.-Q. Jia, âControlled approximation and a characterization of the local approximation order,â Proc. Amer. Math. Soc. , vol. 95, no. 4, pp. 547â553, 1985.
