Support and Approximation Properties of Hermite Splines

In this paper, we formally investigate two mathematical aspects of Hermite splines which translate to features that are relevant to their practical applications. We first demonstrate that Hermite splines are maximally localized in the sense that their support sizes are minimal among pairs of functions with identical reproduction properties. Then, we precisely quantify the approximation power of Hermite splines for reconstructing functions and their derivatives, and show that they are asymptotically identical to cubic B-splines for these tasks. Hermite splines therefore combine optimal localization and excellent approximation power, while retaining interpolation properties and closed-form expression, in contrast to existing similar approaches. These findings shed a new light on the convenience of Hermite splines for use in computer graphics and geometrical design.


Introduction
In his seminal 1973 monograph on cardinal interpolation and spline functions [1], I.J.Schoenberg explains and characterizes B-spline interpolation, which still inspire researchers and yield exciting applications nowadays.In the same work, he also sets the basis of Hermite interpolation [2,3].In the classical B-spline framework, a continuous-domain function is constructed from a discrete sequence of samples.By contrast, the Hermite interpolation problem involves two sequences of discrete samples, which impose constraints not only on the resulting interpolated function but also on its derivatives up to a given order.
Curves in the plane or surfaces in the volume can be constructed from one-dimensional interpolation schemes R → R by interpolating along each spatial coordinate.The practical value of Hermite splines in this context is to offer tangential control on the interpolated curve.This can be easily understood through their link with Bézier curves [7].The latter lie at the heart of vector graphics and are popular tools for computer-aided geometrical design and modelling [8,9,10].Hermite splines are also an interesting option for the design of multiwavelets, that is, wavelets with multiple generators [12,13] because of their small support.In practice, Hermite splines thus provides a suitable solution to a number of problems, whether with respect to simplicity of construction, efficiency, or convenience.This hands-on intuition can be translated to formal properties of Hermite splines and mathematically characterized.As examples, the joint interpolation properties of Hermite splines (see Section 1.2), which ensure that, at integer values, the interpolated function exactly matches the sequences of samples and derivatives samples that were used to build it; their smoothness properties [11], which guarantee low curvature of the interpolated curve under some mild conditions; and their statistical optimality (in terms of MMSE) for the reconstruction of second-order Brownian motion from direct and first derivative samples [14].In that spirit, we investigate in this work the theoretical counterpart of two additional features that are observed to grant Hermite splines their practical usefulness.

Contributions
Our contributions state the minimal support property of Hermite splines and investigate their approximation power.In the following, we describe the practical observations motivating them, the results themselves, and related works.
Minimal support property.The short support of Hermite splines is an important feature making them attractive in practice.The size of the support relates to the local extent of modifications on the continuously-defined spline curve.We formally demonstrate that Hermite splines have the minimal support property among basis functions generating cubic and quadratic splines.When dealing with B-splines, there is a trade-off between the ability to reproduce smooth functions, which only depends on the B-spline order and thus maximum polynomial degree, and the possibility to allow for sharp transitions, as the regularity of the spline increases with its order.Typically, cubic splines can efficiently reproduce smooth functions, but lack the power to capture irregular transitions.On the other hand, quadratic splines have lesser approximation power, but are preferred when dealing with sharp transitions.Hermite splines combine these two strengths in one scheme and are, in terms of support size, better than any two-functions scheme, including the one composed of the classical cubic and quadratic B-splines.In addition, we also show that one necessarily requires two generators to achieve this optimality.This result relates to similar ones involving a single generator [15,16].
Rate of decay of the approximation error.Hermite splines can provide faithful approximation reasonably fast as the number of parameters increases.This feature relates to the rate of decay of the approximation error.Numerous works approach these questions by restricting themselves to a specific interpolation framework, such as [17,18] for the specific case of Hermite approximation.They provide precise estimations of the optimal bound on the approximation error relying on L ∞ norms, but do not allow comparison with other schemes.In contrast, approaches have been developed for single [19] and multiple generators [20] to provide a unifying setting for comparison.Their rigorous mathematical framework offer generalized measures that can be applied to a wide variety of basis functions for estimating approximation constants.Hermite interpolation however violates some of the core assumptions of the analysis, preventing it from being studied with these tools.Taking strong inspiration from this previous work, we provide a novel study of Hermite approximation with a analogous analysis strategy, relieving the boundedness assumptions and allowing to consider additional spline approximation schemes.We precisely quantify the rate of decay of the approximation error of the Hermite scheme and quantitatively estimate the corresponding approximation constants.Hermite splines have excellent approximation properties when it comes to reconstructing a function and its first derivative, actually being close to optimal.The investigation of approximation error on the derivative relates to [21,22], although following a completely different line: while they focused on the reconstruction of the derivative from signal samples, the Hermite scheme grants direct access on the function and derivative samples, allowing to reconstruct the derivative in a multi-function setting.
Pioneering works cover the study of spline schemes to an impressive degree of generality [23,24,25,26].They include results on minimum support and approximation errors in a large variety of cases.Regarding minimum support, these previous results are however restricted to single generator schemes.To the best of our knowledge, we are not aware of previous work considering multi-generators and therefore covering the Hermite case.These studies also do not focus on providing a way to quantify the approximation error constants, thus not enabling comparison between schemes of the same order.As mentioned beforehand, frameworks have been proposed to address this, but the Hermite scheme falls outside of their core hypotheses, therefore requiring a formal adaptation.

Hermite Splines
Schoenberg defines the cardinal cubic Hermite interpolation problem as follows [2,3].Knowing the discrete sequences of numbers c[k] and d[k], k ∈ Z, we look for a continuously-defined function f ) bounded by a polynomial, but we shall restrict to sequences in 2 (Z) thereafter.In [3], it is shown that the Hermite spline f Her associated to the sequences c and d can be expressed as Figure 1 -Cubic Hermite splines φ 1 and φ 2 .The two functions and their derivatives are vanishing at the integers with the exception of φ 1 (0) = 1 and φ 2 (0) = 1 (interpolation properties).They are supported in where the functions φ 1 and φ 2 are given by In addition to their fairly simple analytical expression, the cubic Hermite splines have other important properties.First, they are of finite support in [−1, 1].Moreover, the generating functions φ 1 , φ 2 and their derivatives φ 1 , φ 2 satisfy the joint interpolation conditions for all k ∈ Z, where δ[k] is the discrete unit impulse.The functions and their first derivative are depicted in Figure 1, where the interpolation properties can easily be observed.The functions φ 1 and φ 2 are deeply intertwined as c[k] = f Her (k) and d[k] = f Her (k) in (1).The cubic Hermite splines are differentiable with continuous derivatives at the integer knots points t = k.As a result, functions generated by cubic Hermite splines are C 1 -continuous piecewise-cubic polynomials with knots at integer locations.
2 Minimum Support Properties of Hermite Splines B-splines are known to be maximally localized, meaning that they are compactly supported with minimal support properties among functions with the same approximation properties [27,28].Hermite splines possess a similar fundamental minimal support property: they are of minimal support among the pair of functions being able to generate both quadratic and cubic splines (Theorem 2).In addition, a single generating function is not sufficient for this purpose (Proposition 4).This demonstrates that Hermite splines are maximally localized for the purpose of representing piecewise-cubic functions that are continuously differentiable, as exploited for instance in image processing [11].

Shift invariant spaces and support properties
Consider a set of N ≥ 1 functions ϕ = (ϕ 1 , . . ., ϕ N ) ∈ (L 2 (R)) N and define the space of functions We say that ϕ i are basis functions of the set V (ϕ).The space V (ϕ) is shift-invariant in the sense that, by definition, 24,25,29].We consider shift-invariant spaces generated by a single (N = 1) or two functions (N = 2), corresponding to B-splines and Hermite splines, respectively.We only consider spaces (5) for which the family for any c i ∈ 2 (Z) with i = 1, . . ., N and for some constants 0 < A ≤ B < ∞.This ensures that any f ∈ V (ϕ) has a unique and stable representation.
Support properties of B-splines.Under the Riesz condition, a natural question is the ability of the basis functions ϕ to exactly reproduce classes of functions.The possibility to perfectly reproduce polynomials is of crucial importance.The constant function 1 can be reproduced if and only if the basis functions satisfy the partition of unity, which is the minimal requirement for a practical approximation scheme [30].
The polynomial B-spline of order L ≥ 1 is classically known to be able to reproduce polynomials up to degree (L − 1); that is, t for every = 0, . . ., (L − 1).Following [31], we denote it by β (L−1) .In particular, the cubic B-spline (of order L = 4), can perfectly reproduce any polynomial of degree at most 3.The ability of the basis functions ϕ to perfectly reproduce polynomials is intimately linked to their approximation power, as will be developed in Section 3. B-splines are actually the most localized functions satisfying this property, as formalised in Proposition 1.
k∈Z is a Riesz basis and can reproduce polynomials up to degree (L − 1) ≥ 0. Then the support of ϕ is at least of size L.
In particular, the B-spline of order L, whose support is of size L, is optimal in terms of support localization among basis functions that are able to reproduce polynomials of degree at most (L − 1).
This result is classical in approximation theory: Schoenberg showed that B-splines effectively have the adequate approximation order [1].A complete characterization of the functions of minimal support with a given approximation order can be found in [16,Theorem 1].To the best of our knowledge, very little is known about the localization of basis functions when N > 1, which is what we propose to investigate.

Minimal Support Properties for Two Basis Functions
Hermite splines φ 1 and φ 2 , given by ( 2) and ( 3), are able to reproduce both β 2 and β 3 , the quadratic and cubic B-splines of order 3 and 4, respectively [11].In particular, this means that V (φ 1 , φ 2 ) contains polynomials of degree at most 3.Many other pairs of basis functions, starting with β 2 and β 3 themselves, can also reproduce quadratic and cubic splines.In line with Proposition 1, investigating the support localization of a pair of functions having the same reproduction properties as the Hermite splines follows naturally.This boils down to studying basis functions for which We characterize the support size of such pairs of functions in Theorem 2. This result then allows us to deduce the minimum support property of Hermite splines in Corollary 3.
with reproduction sequences a, b, c, d In particular, the quadratic and cubic B-splines β 2 , β 3 are in V (ϕ 1 , ϕ 2 ).Then, we have that Proof.First of all, one can restrict to compactly supported basis functions ϕ 1 and ϕ 2 (otherwise, |Suppϕ 1 |+|Suppϕ 2 | = ∞).If one of the basis function, for instance ϕ 2 , is identically zero, then the cubic spline β 3 ∈ V (ϕ 1 ).This means in particular that the basis function ϕ 1 reproduces polynomials up to degree 3, and its support is therefore at least of size four [16, Theorem 1].Hence, we again have that We now assume that ϕ 1 and ϕ 2 are not identically 0.
Step 1.We show that the extreme points of the supports of ϕ 1 and ϕ 2 are integers.For x = a, b, c, d, we set X(ω) = k∈Z x k e −jωk , the 2π-periodic Fourier transform of x.
Step 2. We know that the supports of ϕ 1 and ϕ 2 are of the form [a, b] with a < b, a, b ∈ Z.We assume that |Suppϕ 1 | + |Suppϕ 2 | < 4.Then, one of the two basis functions has a support of size one, for instance ϕ 1 .We also assume without loss of generality that Suppϕ 1 = [0, 1], implying that only y 0 , y 1 , z 0 , z 1 are possibly non-zero in (18).Going back to the Fourier domain, one obtains The function ϕ 1 is compactly supported.Its Fourier transform is hence infinitely smooth, and we can do the Taylor expansion of both sides in (19).In particular, we obtain the relations This imposes that y 0 = y 1 = z 0 = z 1 = 0, which is absurd.Finally, it shows that Condition (9) plays an important role in our proof by imposing some regularity in Fourier domain.In practice, one even expects that compactly supported basis functions can generate the B-splines β 2 and β 3 with finitely many coefficients, in which case ( 9) is automatically satisfied.However, we believe that the condition (9) can be relaxed up to some extend.From Theorem 2, we easily deduce that Hermite splines have the minimum support property.
Corollary 3. The Hermite splines (φ 1 , φ 2 ) are of minimal support among the pair of functions that are able to reproduce both quadratic and cubic B-splines with reproduction sequences satisfying (9).
It is worth noting that the supports of the pair of Hermite splines jointly has the same size as the B-spline β 3 .However, β 3 alone has less reproduction property.Being of class C 2 , it is in particular unable to reproduce the quadratic spline β 2 , which only has C 1 transitions at the integers.The simplest way of reproducing β 2 , β 3 is to consider the basis pair (β 2 , β 3 ) itself, which is not maximally localized since the sum of the supports is 7.An important additional remark is that two functions are needed to reproduce both cubic and quadratic spline, as formalised in Proposition 4. Proposition 4.There exists no single function ϕ ∈ L 2 (R) that is able to reproduce β 2 and β 3 with summable reproduction sequences.
Proof.By contradiction, let us assume that there exists ϕ such that Then, the Fourier transforms A(e jω ) and B(e jω ) are continous 2π-periodic functions.In Fourier domain, we have that Set ω 0 ∈ (0, 2π) and ω 1 = ω 0 + 2π.The relation (21) imposes that A(e jω i ), B(e jω i ), and ϕ(ω i ) are non-zero for i = 1, 2, and After simplifications, we deduce that The right term in ( 23) is equal for ω 0 and ω 1 by periodicity, while the left term is different.This contradicts our initial assumption, and implies Proposition 4.

Approximation Properties of Hermite Splines
Existing approaches have been proposed to characterize the behaviour of the approximation error for single [19] and multi-generators [20].They however assume technical conditions that Hermite interpolation does not satisfy.We therefore formulate new theoretical tools to quantify the asymptotic constant of the approximation error of this scheme.Since functions are estimated with derivative samples in the Hermite case, we also propose to investigate the approximation error on the first derivative.In our setting, other existing approximation schemes can be considered as well, allowing us to put the excellent approximation properties of Hermite splines in perspective with other related schemes, such as cubic B-splines and interlaced derivative sampling.

Generalized Sampling and Approximation Error
The approximation of a continuously-defined signal from a collection of its samples in a generalized sampling scheme relies on two ingredients: some basis functions ϕ = (ϕ 1 , . . ., ϕ N ) ∈ (L 2 (R)) N , and some sampling functions φ = ( φ1 , . . ., φN ) that are rapidly decaying generalized functions, including rapidly decaying L 2 -integrable functions1 together with the Dirac impulse δ, its derivative, and their shifts.The term generalized is motivated by the fact that sampling functions allow accessing more than the values of the signal at the sampling points [33].The set of pairs of basis and sampling functions fully characterize an approximation scheme.Moreover, because we aim at a fair comparison, the quantity of information per unit of time should be equal among the considered schemes.This requires to slightly adapt the definition of V (ϕ) given in (5).From now, we shall consider so that, for any N ≥ 1, there is on average a single degree of freedom on each interval of size one.The sampling and reconstruction problem is then formally defined as follows.The function f is reconstructed by its approximation f associated to the basis functions ϕ and for the sampling fuctions φ, defined as We denote by Q φ ϕ the operator such that Q φ ϕ f = f .Hermite spline approximation thus corresponds to N = 2 with basis functions ϕ 1 (t) = φ 1 ( t 2 ) and ϕ 2 (t) = 2φ 2 ( t 2 ), and sampling functions φ1 (t) = δ(t) and φ2 (t) = −δ (t).
The best approximation of a given scheme is obtained when the pairs of sampling and basis functions are properly chosen such that f is the orthogonal projection of f onto W (ϕ).
This implies imposing a particular condition [20] on the sampling functions φ, namely that where G ϕ is the Gram matrix of size N × N associated to ϕ, given for ω ∈ R by This particular collection of sampling functions are called the dual functions associated to ϕ and are denoted by ϕ d .Note that G ϕ (ω) is invertible for every ω ∈ R -and therefore ( 27) is meaningful -because ( 6) is equivalent to where λ min (ω) (λ max (ω), respectively) is the minimum (maximum, respectively) eigenvalue of G ϕ (ω) [34].When φ is defined as (26), the operator Q φ ϕ is the orthogonal projector over W (ϕ), and is denoted as In this situation, ( 25) is reformulated as To simplify the notation, we shall write P = P ϕ and Q = Q φ ϕ thereafter.The quality of the approximation is then evaluated in terms of approximation error which is expressed as When f = Pf , the error is denoted as , reaching the equality if and only if φ = ϕ d .Up to now, we considered approximation schemes with (generalized) samples taken on the integer grid, corresponding to a sampling step size T = 1.This parameter affects the coarseness of the approximation: when T → 0, the error is expected to vanish.For T > 0, the approximation space (24) becomes and the approximation of f is given by with resulting error The orthogonal projector (28) and its associated error are easily reformulated accordingly.
A number of hypotheses on the basis functions ϕ and the sampling functions φ have to be met in order to study the errors E ϕ (f, T ) and E φ ϕ (f, T ) in terms of rate of decay and asymptotic constant.The first one is the Riesz basis condition (6), which ensures a unique and stable representation.The second one is the basis functions order.Definition 5. A family of N ≤ 1 basis functions ϕ = (ϕ 1 , . . ., ϕ N ) is of order L if they can reproduce polynomial functions up to degree (L − 1), meaning that, for = 0, . . ., (L − 1), there exists sequences c i, such that This condition is known to be equivalent to the Strang and Fix conditions [35].When it is met, the decrease of the optimal error E ϕ (f, T ) is bounded from above by T L [20].The last important condition is that the sampling and basis functions are quasi-biorthonormal of order L. Definition 6.Two families of basis ϕ and sampling functions φ are quasi-biorthonormal of order L if the basis functions are of order L and, for the dual function ϕ d given by (26) and all = 0, . . ., (L − 1), we have It is worth noting that ( 34) is a slight abuse of notation, since the φi are not necessarily defined pointwise.However, they are assumed to be rapidly decaying generalized functions and can therefore be taken against a slowly growing smooth functions such as t → t .The quasi-biorthonormality ensures that the decrease of the error E φ ϕ (f, T ) is also bounded by T L [20].Finally, the rate of decay of the approximation error being under control in all generality, the asymptotic constant can be obtained as which, in practice can be computed relying on a Fourier-domain approximation error kernel.
For more details, we refer the interested reader to [36,37,38] and references therein.

Approximation Constants of Irregular Sampling Schemes
Our goal in this section is to extend the range of applicability of the main results of [20] so as to include Hermite spline approximation.The original framework is indeed restricted to sampling functions φ with bounded Fourier transforms.While this allows considering the case of interpolation, it excludes Hermite spline approximation since the Fourier transform jω of δ is unbounded.
Our development follows the key contributions of [20].We therefore only detail the adaptations that are required in our case.We start with a brief summary of the general approach, which is common to many works of approximation theory in shift-invariant spaces.We first introduce the kernels associated to the functions ϕ, φ as where G ϕ is the Gram matrix (27).The kernel E min relates to the minimum error case achieved using the orthogonal projector (i.e., φ = ϕ d ), and E res to the residual error arising when using sampling functions that differ from the dual functions.We furthermore note that E res (ω) = 0 when φ = ϕ d , as expected.The key ideas of relying on E are as follows.
• The kernel E measures the approximation power of a reasonable approximation scheme for small T > 0.
• The precise behaviour of f −Q T f L 2 is then deduced from that of E around the origin.It depends on the approximation order L of the scheme and, typically, behaves like CT L .The constant C depends on the function to approximate f and on the scheme (ϕ, φ) via the Taylor expansion of E.
We give a precise meaning to these two points in Propositions 8 and 9 below.Before that, we recall an important lemma taken from [20] that will play a fundamental role in our proofs.
Lemma 7.For k ≥ 0, we set f k (ω) = f (ω)1 k/T ≤|ω|<(k+1)/T .Then, the following relations hold: The equality (39) is obvious.The two next relations comes from [20, Theorem 1] and we have simply reformulated the results with our notation.First, it is proven (see (27) in [20]) that f −Q T f L 2 = ´R|f k (ω)| 2 E(T ω)dω as soon as f (ω) f (ω −n/T ) = 0 for any ω ∈ R and n ∈ Z, a condition that is satisfied by the f k by construction, giving (40).Moreover, the inequality (41) appears in the proof of [20, Theorem 1] (see (63)).Proposition 8. Let (ϕ, φ) be a set of N basis and sampling functions that are biorthonormal and provide an approximation scheme of order L. We assume moreover that the kernel E given by (38) satisfies for some C > 0, some integer 0 ≤ p ≤ L, and every ω ∈ R.Then, for every The case p = 0 corresponds to E being bounded and can be found in [20, Theorem 1].
where we used (41) in (i).As a consequence, (43) follows if one shows that the two terms (I) and (II) in (44) are O(T L+1 ).Using (40), we have where the inequality is due to |ω| ≥ k/T over the domain and to (42), which implies that C 2 ≥ sup ω∈R E(ω)/ max(1, |ω| p ) ≥ sup |ω|≥1 E(ω)/|ω| p .Summing over k > 0, we deduce that where the second inequality is derived from Cauchy-Schwarz, and ζ is the Riemann zeta function.For the second term, we remark that, again due to [20, (27)], is a consequence of the Minkowski inequality, we deduce that where the inequality once more follows from |ω| ≥ 1/T over the domain and from our assumption (42).Combining (46) and (47) in (44) completes the proof.
Our next result connects the expression ´R| f (ω)| 2 E(T w)dω to the Taylor expansion of E.
Note that we use derivatives of fractional order γ = L + 1/2 and γ = L + p + 1/2 in the proof, which are defined in the Fourier domain as F{f (γ) }(ω) = (jω) γ f (ω).Finally, we conclude with an extension of [20,Theorem 4] to sampling functions that are not necessarily bounded in Fourier domain.
Theorem 10.We consider an approximation scheme (ϕ, φ) with N basis and sampling functions such that • the basis functions are rapidly decaying L 2 functions such that the family {ϕ i (• − N k} i=1•••N,k∈Z is a Riesz basis in the sense of (6), with approximation power of order L ≥ 1 (see Definition 5); • The sampling functions are rapidly decaying generalized functions such that (ϕ, φ) is biorthonormal of order L (see Definition 6); • There exists an integer 0 ≤ p ≤ L such that, for any ω ∈ R, any 0 ≤ k ≤ L, and any Then, for any f ∈ W L+max(p+1/2,1) (R), we have that The two first conditions in Theorem 10 are necessary to ensure that the approximation scheme has an approximation power of order L. The last condition allow us to show that such an approximation power is attained with restricted condition on the sampling functions having possibly unbounded Fourier transform.
Proof.We prove that the conditions of Theorem 10 imply that we fulfill the hypotheses of both Propositions 8 and 9.
Since ϕ, φ are rapidly decaying (generalized) functions, their Fourier transforms ϕ and φ are infinitely differentiable.The same holds true for ϕ d = G −1 ϕ ϕ since G ϕ is a matrixvalued infinitely differentiable function with infinitely differentiable inverse G −1 ϕ due to the Riesz basis condition.This implies that E is infinitely differentiable and therefore (2L + 1)times continuously differentiable.
The basis functions are rapidly decaying, hence in L 1 (R), impling that ϕ is bounded.The Riesz basis condition then easily implies that both G ϕ and its inverse are bounded as functions of ω.It then follows that E min (ω) is bounded, while E res (ω) is dominated by ( φ − ϕ d )(ω) , the latter being dominated by max(1, |ω| 2p ) due to (54).It finally implies (42) for some constant C > 0. Similarly, for k ≤ L, the function ϕ (k) is bounded, being the Fourier transform of t → t k ϕ(t), which is in L 1 (R) due to the rapid decay of ϕ.Again, this property is transferred to the derivative of G ϕ and its inverse.Then, exploiting Leibnitz rule, one shows that E (2L+1) min is bounded, while E (2L+1) is a sum of products constituted of bounded terms and of two terms of the form φi (ω), which are controlled by (54).Putting things together, we easily deduce (48) for some constant C > 0.
Note that [20,Theorem 4] corresponds to Theorem 10 with p = 1, and with less restrictive assumptions on ϕ and φ (essentially, the rapid decay is replaced by polynomial decay adapted to L).The condition f ∈ W L+max(p+1/2,1) (R) reflects the cost of covering the scenario of possibly irregular sampling functions with unbounded Fourier transform.

Approximation Properties of Hermite Splines
We can now evaluate the approximation error on f in different frameworks, including the Hermite scheme.In our analysis, for (ϕ, φ) being fixed, we also quantify the error on the derivative f when we approximate it by (Q T f ) .We therefore study the quantities Knowing the order of approximation L ≥ 1, the quality of the approximation is quantified by the two asymptotic constants The asymptotic constant of C φ ϕ,2 can be computed with the same tools as that of C φ ϕ,1 .Using integration by parts, we indeed have that where the new sampling functions are best defined in the Fourier domain as As one power of T gets lost in the differentiation process, the rate of decay of the error on f is thus equal to (L − 1).Note that the apparent singularity in (60) around 0 is counter-balanced in the analysis since one only approximates functions f that are derivatives functions, hence for which f (ω) = jω f (ω).
In the Hermite framework, for which N = 2, sampling functions are taken as φ1 = δ and φ2 = −δ and basis functions as (2) and (3).For comparison purpose, we also consider two relevant schemes that fit our analysis framework: classical cubic B-splines and interlaced derivative sampling.Cubic B-spline approximation corresponds to 1 ) −1 is the direct B-spline filter, and φ = β 3 the cubic B-spline [31].Interlaced derivative sampling can be defined in the more general framework of generalized sampling without band-limited constraints [36].In this setting, N = 2 and the sampling functions correspond to φ1 = δ and φ2 = −δ • − 1 2 .The basis functions are constructed from the cubic B-spline to allow for a fair comparison, and are given by in the Fourier domain.A comprehensive description of their derivation is provided in [38].
It is worth noting that the sampling functions do not correspond to the dual functions in these frameworks.This is easily motivated by practical considerations: the sampling process must, in practice, be implemented with digital filtering, excluding dual functions due to their continuous nature.The dual functions can, however, still be constructed from the Gram matrix following (26) so as to estimate the optimal approximation error.We now reveal the approximation power of these three different schemes.The results are known for the cubic B-splines [19] and are included for comparison purposes.For Hermite approximation and interlaced sampling, they are deduced from Theorem 10, and are not included in the multigenerator framework [20], whose hypotheses exclude the use of derivative samples.Proposition 11.Let (ϕ, φ) be one of the three approximation schemes considered above.Then, we have that (R) (Hermite splines or interlaced derivative sampling).Moreover, in the three cases, we have the following relation to the optimal approximation scheme associated to ϕ: for every f ∈ W 5 2 (R) (cubic B-splines), or f ∈ W (R) (Hermite splines and interlaced derivative sampling).
Proof.The three frameworks are readily known to define approximation schemes of order L = 4 [31,11,36].All the considered basis functions specify a Riesz basis, are rapidly decaying (Hermite and cubic B-splines are compactly supported, while the basis functions for interlaced derivative sampling, despite being non-compactly supported, are exponentially decaying [36]), and reproduce polynomials up to degree 3. The sampling functions are rapidly decaying generalized functions.Indeed, they are compactly supported for the Hermite and interlaced derivative sampling schemes.For cubic B-splines, we have seen that φ = k∈Z (b 3 ) −1 [k]δ(• − k), where the sequence (b 3 ) −1 is known to be exponentially decaying [31], implying the result.In addition, for the Hermite and interlaced derivative sampling schemes (for cubic splines, respectively), ( 54) is clearly satisfied with p = 1 (p = 0, respectively).The conditions of Theorem 10 are therefore satisfied for L = 4, implying (55).
The value of E (2L) (0) is computed by computing the Taylor expansion of the kernel E around 02 .The analysis of the approximation error on the derivative follows the same principle, the kernel being given for (ϕ , φint ) according to (60), giving (63).
We obtain the asymptotic behaviour of the optimal approximation errors f − P T f L 2 and f − (P T f ) L 2 associated to φ = ϕ d in the same way, leading to (64).
Our findings call for the following comments.
• The three compared schemes have the same approximation order, the same approximation constant, and the same optimal approximation constant (associated to (ϕ, ϕ d )) for reconstructing both f and its derivative.
• In all cases, the sampling functions result in a near-to-optimal asymptotic constant C φ ϕ,1 for the reconstruction of f .This minor discrepancy of a factor of 10/3 ≈ 1.83 is expected from the fact that the sampling functions are not dual functions.It is also remarkable that the reconstruction of the derivative, while not being associated to the dual functions, is associated to an optimal approximation constant C φ ϕ,2 .• Dual functions, although offering the smallest approximation error, have strong practical disadvantages.First, the ϕ d , are non-compactly supported splines.More importantly, they cannot be easily implemented as they do not have a digital filter equivalent (i.e., computing the f, ϕ d does not only depend on knowing f and its derivative on a fixed grid, in contrast to usual cubic B-splines and Hermite splines).Finally, they do not possess a closed-form expression in general.For these reasons, the sampling functions φ classically used in the three considered approximation schemes, although non-optimal, are preferable in practice.
In Table 1, we sum up these findings, including the asymptotic constants for cubic B-spline, interlaced derivative sampling and cubic Hermite splines and their comparison with optimal constants.Hermite interpolation is thus not a unique way of approximating a function and its first derivative, even if one wishes the error to remain close to optimal.The notable difference lies in the fact that the Hermite scheme provides functions that are simultaneously of finite support, which is not the case for interlaced derivative sampling (see (61) and (62)), and interpolating, which is not the case for cubic B-splines.
such that f Her is piecewise polynomial of degree at most 3 and once differentiable with continuous derivative at the integers.The existence and uniqueness of the solution is guaranteed [2, Theorem 1] for any sequences c = (c[k]) and d = (d[k]