Box-splines orthogonal projections
M. Be\'ska, K. Dziedziul

TL;DR
This paper generalizes a known result about orthogonal projections of polynomial functions to the broader context of box-splines, enabling new ways to define Sobolev space seminorms via projection error asymptotics.
Contribution
It extends Sweldens and Piessens's result from polynomial splines to box-splines, linking projection errors to Sobolev space seminorms.
Findings
Generalization of Bernoulli polynomial relation to box-splines
New characterization of Sobolev seminorms via projection error asymptotics
Potential applications in approximation theory and numerical analysis
Abstract
Let be orthogonal projection on B-splines of degree with equally spaced knots. Sweldens and Piessens proved that is Bernoulli polynomial. We generalize Sweldens ans Piessens's result for box-splines. It gives the opportunity to define the seminorm of Sobolev space in terms of the asymptotic formula for the error in orthogonal projection.
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.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Image and Signal Denoising Methods · Statistical and numerical algorithms
Box-splines orthogonal
projections
M. Beśka, K. Dziedziul
Abstract. Let be orthogonal projection on B-splines of degree with equally spaced knots. Sweldens and Piessens proved that is Bernoulli polynomial. We generalize Sweldens ans Piessens’s result for box-splines. It gives the opportunity to define the seminorm of Sobolev space in terms of the asymptotic formula for the error in orthogonal projection. 41A15, 41A35, 41A60. Keywords: box spline, Bernoulli spline, asymptotic formula, orthogonal projection, function of polynomials.
1. Introduction
In this year (2018) a beautiful paper [10] on box-spline was published. So I would like to present some of the results from a paper published in East Journal of Approximation EJA, vol 10 (4) 2004, since EJA is rather difficult to reach. I hope that our results will be interesting.
The second part of the paper published in EJA is devoted to sets with finite perimeter through perspective of Botschkarev’s theorem and this research was never entirely finished.
We start by recalling some basic facts and terminology.
Let denote the Sobolev spaces, with the norm
[TABLE]
where
[TABLE]
[TABLE]
and
[TABLE]
Let denote a set of not necessarily distinct, non zero vectors in , such that
[TABLE]
We call such set admissible. The box spline denoted by corresponding to is defined by requiring that
[TABLE]
holds for any continuous function on , see reference [5]. As usual
[TABLE]
The Fourier transform is given by
[TABLE]
Here and subsequently ”” denotes the scalar product in . From (1) by simple calculation we get that
[TABLE]
where
[TABLE]
We denote by the cardinality of the set . For an admissible set let
[TABLE]
This parameter determines the smoothness of a box splines
[TABLE]
Let us define
[TABLE]
where and the closure is taken in . The orthogonal projection from onto is denoted by . Denoting by the inner product in , the orthogonal projection onto can be written by :
[TABLE]
where
[TABLE]
A family is unimodular if for all with we have . Set
[TABLE]
and
[TABLE]
2. Box-spline orthogonal projections
Let us define
[TABLE]
The above definition is a little misleading. We simply can also enlarge a definition of for a class of functions with polynomial growth. Note that in the univariate case is a Bernoulli spline for , see [14]. In [8] it was proved in a particular case that is linear combination of Bernoulli splines. In this section we generalize this results, see Theorem 2.4 below. Applying this result we simplify the asymptotic formula for orthogonal projection calculated in [4]. Our method in the case of implies Theorem 2.2 of [2].
We know that is a periodic piecewise polynomial and from Lemma 3.4 in [8] we have:
Lemma 2.1**.**
Let . Then
[TABLE]
The series converges in every point of continuity of .
In fact the problem of the convergence appears only for box splines with and on the boundary of the support of that box-splines. By Theorem 2.6 and Remark 2.9 we write for as a linear combination of a Bernoulli spline , where the Fourier series of converges also in the point of discontinuity of (i.e ) to zero.
Define a set ,
[TABLE]
Let . If for all
[TABLE]
we will denote that . Note that the vectors from span a hyperplane in i.e. -dimensional subspace. From definition of the set we get that for all such that
[TABLE]
Definition 2.1**.**
Let us define Bernoulli splines [11] for by
[TABLE]
and .
Lemma 2.2**.**
Let be unimodular and let . Let for given . Then if where
[TABLE]
then .
Proof.
Note that by (2)
[TABLE]
Since then for
[TABLE]
since for and . Since , (9) shows that
[TABLE]
which implies theorem. ∎
Lemma 2.3**.**
Let be unimodular and let . Let for given . Then .
Proof.
Note that since spans . If then from Lemma 1.4 we get that . Moreover , hence , it follows that .
Let us assume that . But , hence . This is a contradiction with definition of see (3). ∎
Theorem 2.4**.**
Let be unimodular. Then is a linear combination of Bernoulli splines
[TABLE]
where
[TABLE]
Proof.
By Lemma 2.1 and Lemma 2.5 we get
[TABLE]
By (10) we get that
[TABLE]
Note that
[TABLE]
Consequently
[TABLE]
∎
Let us recall the results form [4] and [8].
Theorem 2.5**.**
Let . Let be unimodular. Let . Then
[TABLE]
[TABLE]
Now we want to examine the right part of (13).
Theorem 2.6**.**
Let be unimodular then
[TABLE]
where
[TABLE]
and is the directional derivative.
Proof.
From Lemma 2.1 and 2.5 we get
[TABLE]
[TABLE]
[TABLE]
Note that the sets , where are disjoint. Tedious calculation shows that
[TABLE]
Consequently using (12), (11) and (14) we get the theorem. ∎
Remark 2.1*.*
Let be unimodular. Then
-
the functions , are orthogonal.
-
Since all norms in a finite dimension space are equivalent we get
[TABLE]
[TABLE]
[TABLE]
For we have equality and we obtain the Theorem 2.2 [2], com. [7].
Remark 2.2*.*
Note also that for all there is a vector such that
[TABLE]
Thus
[TABLE]
where is Bernoulli polynomial
[TABLE]
Consequently changing the variable we get
[TABLE]
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Beśka, K. Dziedziul, The saturation theorem for interpolation and Bernstein - Schnabl operator, Math. Comp. 70, (2001), 705–717
- 2[2] M. Beśka, K. Dziedziul, The saturation theorem for orthogonal projection, Advances in Multivariate Approximation, W. Haußmann, K. Jetter and M. Reimer (eds.) (1999), 73-83.
- 3[3] M. Beśka, K. Dziedziul, Asymptotic formula for the error in cardinal interpolation, Num. Math. 89, 3 (2001), 445-456.
- 4[4] M. Beśka, K. Dziedziul, Asymptotic formula for the error in orthogonal projection, Math. Nach. 233, (2002), 47-53.
- 5[5] C. de Boor, K. Höllig and S. Riemenschneider (1993), Box Splines, Springer-Verlag.
- 6[6] S.V. Botschkarev, On the coefficient of Fourier-Haar series (in Russian) Mat. Sbor. 80 (1969) pp. 97-116.
- 7[7] I. Daubechies and M. Unser, On the approximation power of convolution-based least squares versus interpolation, IEEE Trans. Sign. Proc. 45, No. 7, (1997) pp. 1697–1711.
- 8[8] K. Dziedziul, Asymptotic formulas in cardinal interpolation and orthogonal projection . In: Recent Progress in Multivariate Approximation, W. Haussmann, K. Jetter, M. Reimer (eds.), Internat. Ser. Numer. Math. 137, 139-157, Birkh user, Basel-Boston-Berlin 2001.
