Some recurrence formulas for box splines and cone splines

A degree elevation formula for multivariate simplex splines was given by Micchelli and extended to hold ]or multivariate Dirichlet splines in [8]. We report similar formulae for multivariate cone splines and box splsplines andines. To this end, we utilize a relation due to Dahmen and Micchelli that connects box cone splines and a degree reduction formulagiven by Cohen, Lyche, and Riesenfeld in [2].     

SOME RECURRENCE FORMULAS FOR BOX SPLINES AND CONE SPLINES

A degree elevation formula for multivariate simplex splines was given by Micchellis[6] and extended to hold for multivariate Dirichlet splines in [8].We report similar formulae for multivariate cone splines and box splines.To this and ,we utilize a relation due to Dahmen and Micchelli[4] that connects box splines and cone splines and a degree reduction formula given by Cohen,Lyche,and Riesenfeld in [2].     

Quasi-interpolation projectors for box splines

We consider box spline quasi-interpolants based on local linear functionals of point evaluator and integral type. The approximations are easy to compute, and reproduce the whole spline space in question.     

Exponential box splines

In a recent paper by Nira Dyn and the author, univariate cardinal exponential B-splines are shown to have a representation similar to the wellknown box spline representation of the univariate cardinal polynomialB-splines. Motivated by this, we construct, for a set ofn directions inZ ^s and a vector of constants λ ?R ⁿ, an “exponential box spline” which has the same smoothness and support as the polynomial box spline, and is a positive piecewise exponential in its support. We derive recurrence relations for the exponential box splines which are simpler than those for the polynomial case. A relatively simple structure of the space spanned by the translates of an exponential box spline is obtained for λ in a certain open dense set ofR ⁿ—the “simple” λ. In this case, the characterization of the local independence of the translates and related topics, as well as the proofs involved, are quite simple when compared with the polynomial case (corresponding toλ = 0).     

Cones and recurrence relations for simplex splines

We prove some new relations between functions defined as shadows of cones (cone splines) and simplices (simplex splines). We use them to show how ans-variate simplex spline of some orderk can be written as a sum ofk+1 (s-l)-variate simplex splines of orderk-1. A recurrence relation on the spatial dimension of the simplex spline,s, is proposed as an interesting alternative to the recurrence relation in [17], where one uses the orderk for recursion, but not the spatial dimensions.     

Cardinal hermite interpolation with box splines

The study of cardinal interpolation (CIP) by the span of the lattice translates of a box spline has met with limited success. Only the case of interpolation with the box spline determined by the three directionsd ₁=(1, 0),d ₂=(0, 1), andd ₃=(1, 1) inR ² has been treated in full generality [2]. In the case ofR ^d,d ≥ 3, the directions that define the box spline must satisfy a certain determinant condition [6], [9]. If the directions occur with even multiplicities, then this condition is also sufficient. For Hermite interpolation (CHIP) both even multiplicities and the determinant condition for the directions does not prevent the linear dependence of the basis functions. This leads to singularities in the characteristic multiplier when using the standard Fourier transform method. In the case of derivatives in one direction, these singularities can be removed and a set of fundamental splines can be given. This gives the existence of a solution to CHIP inL ^p (R ^d) for data inl ^p (Z ^d), 1≤p≤2.     

Algebraic properties of discrete box splines

The central objective of this paper is to discuss linear independence of translates of discrete box splines which we introduced earlier as a device for the fast computation of multivariate splines. The results obtained here allow us to draw conclusions about the structure of such discrete splines which have, in particular, applications to counting the number of nonnegative integer solutions of linear diophantine equations.     

On the evaluation of box splines

Straightforward use of the recurrence relations for box splines quickly leads to difficulties which are ultimately due to the fact that step functions are not computable. The note outlines how to deal with these difficulties and offers amatlab program for the (correct) evaluation of a box spline. Since use of the recurrence relation is very time-consuming, various alternatives are discussed as well.     

Stable evaluation of box‐splines

The most elegant way to evaluate box-splines is by using their recursive definition. However, a straightforward implementation reveals numerical difficulties. A careful analysis of the algorithm allows a reformulation which overcomes these problems without losing efficiency. A concise vectorized MATLAB-implementation is given. This revised version was published online in June 2006 with corrections to the Cover Date.     

Exact inequalities for splines and best quadrature formulas for certain classes of functions

In this note inequalities between the norms of a spline and its derivatives in various Orlich spaces are obtained. These inequalities are analogs of the inequalities of L. V. Takov for trigonometrical polynomials and generalize S. N. Bernstein's inequalities. An inequality for monosplines which reduces to the best quadrature formula for the classes W^rL₁, where r=1, 2,..., is also obtained. For r=2, 4, 6, ... this result was obtained earlier by V. P. Motornyi.Translated from Matematicheskie Zametki, Vol. 19, No. 6, pp. 913–926, June, 1976.     

Some duality relations for local splines

We obtain duality relations for local periodic cubic and parabolic splines of minimal defect and establish some of their corollaries.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 1, pp. 12–19, January, 1995.This research was supported by the Ukrainian State Committee on Science and Technology.     

Algorithms for cardinal interpolation using box splines and radial basis functions

Summary We describe an algorithm for (bivariate) cardinal interpolation which can be applied to translates of basis functions which include box splines or radial basis functions. The algorithm is based on a representation of the Fourier transform of the fundamental interpolant, hence Fast Fourier Transform methods are available. In numerical tests the 4-directional box spline (transformed to the characteristical submodule of ²), the thin plate spline, and the multiquadric case give comparably equal and good results.     

Cardinal hermite interpolation with box splines II

Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L ² together with its directional derivatives mentioned above. Moreover, for data sequences inl ^p ( ^d ), 1p2, there is a spline function inL ^p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst     

On cubic formulas related to the mixed Hermite splines

A cubic formula containing partial integrals is considered on a class of functions of two variables. It is shown that the integral of a mixed Hermite spline gives the best cubic formula for the given class. The coincidence of cubic formulas, which are exact for odd and even mixed Hermite splines, is established.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.45, No. 4, pp. 579–581, April, 1993.     

Fortran subroutines for B-nets of box splines on three- and four-directional meshes

We describe an algorithm to compute the B-nets of bivariate box splines on a three-or four-directional mesh. Two pseudo Fortran programs for those B-nets are given.Research supported by a Faculty Grant From the University of Utah Research Committee.