Polynomial splines as examples of Chebyshevian splines

We consider geometrically continuous polynomial splines defined on a given knot-vector by lower triangular connection matrices with positive diagonals. In order to find out which connection matrices make them suitable for design, we regard them as examples of geometrically continuous piecewise Chebyshevian splines. Indeed, in this larger context we recently achieved a simple characterisation of all suitable splines for design. Applying it to our initial polynomial splines will require us to treat polynomial spaces on given closed bounded intervals as instances of Extended Chebyshev spaces, so as to determine all possible systems of generalised derivatives which can be associated with them.     

Birkhoff interpolation by Chebyshevian splines

This paper deals with the interpolation of the function and its derivative values at scatted points, so-called Birkhoff Interpolation, by piecewise Chebyshevian spline. Research supported in part by NSERC Canada under Grant ≠A7687. This research formed part of a Thesis written for the Degree of Master of Science at the University of Alberta undr the supervision of Professor S.D. Riemenschneider.     

On a general new class of quasi Chebyshevian splines

We prove that a general class of splines with sections in different Extended Chebyshev spaces or in different quasi Extended Chebyshev spaces can be viewed as quasi Chebyshevian splines, that is, as splines with all sections in a single convenient quasi Extended Chebyshev space. As a result, we can affirm the presence of blossoms in the corresponding spline spaces, with all the important consequences inherent in blossoms, namely, the possibility of developing all design algorithms for splines, the existence of B-splines bases, along with their optimality.     

Approximation by Chebyshevian Bernstein Operators versus Convergence of Dimension Elevation

On a closed bounded interval, consider a nested sequence of Extended Chebyshev spaces possessing Bernstein bases. This situation automatically generates an infinite dimension elevation algorithm transforming control polygons of any given level into control polygons of the next level. The convergence of these infinite sequences of polygons towards the corresponding curves is a classical issue in computer-aided geometric design. Moreover, according to recent work proving the existence of Bernstein-type operators in such Extended Chebyshev spaces, this nested sequence is automatically associated with an infinite sequence of Bernstein operators which all reproduce the same two-dimensional space. Whether or not this sequence of operators converges towards the identity on the space of all continuous functions is a natural issue in approximation theory. In the present article, we prove that the two issues are actually equivalent. Not only is this result interesting on the theoretical side, but it also has practical implications. For instance, it provides us with a Korovkin-type theorem of convergence of any infinite dimension elevation algorithm. It also enables us to tackle the question of convergence of the dimension elevation algorithm for any nested sequence obtained by repeated integration of the kernel of a given linear differential operator with constant coefficients.     

Chebyshevian multistep methods for ordinary differential equations

Summary In this paper some theory of linear multistep methods fory ^(r) (x)=f(x,y) is extended to include smooth, stepsize-dependent coefficients. Treated in particular is the case where exact integration of a given set of functions is desired.Work on this paper was supported in part by U.S. Army Research Office (Durham) Grant DA-ARO(D)-31-124-G1050 and National Science Foundation Grant GP-23655 with The University of Texas at Austin.     

Understanding recurrence relations for Chebyshevian B-splines via blossoms

The purpose of this article is to show how naturally recurrence relations for most general Chebyshevian B-splines emerge from blossoms. In particular, this work gives a new insight into previous results by Lyche [A recurrence relation for Chebyshevian B-splines, Constr. Approx. 1 (1985) 155–178], the importance of which it underlines.     

Some recurrence formulas for box splines and cone splines

A degree elevation formula for multivariate simplex splines was given by Micchelli [6] and extended to hold for multivariate Dirichlet splines in [8]. We report similar formulae for multivariate cone splines and box_splines. To this end, 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].     

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].     

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].     

Sizer for smoothing splines

Smoothing splines are an attractive method for scatterplot smoothing. The SiZer approach to statistical inference is adapted to this smoothing method, named SiZerSS. This allows quick and sure inference as to “which features in the smooth are really there” as opposed to “which are due to sampling artifacts”, when using smoothing splines for data analysis. Applications of SiZerSS to mode, linearity, quadraticity and monotonicity tests are illustrated using a real data example. Some small scale simulations are presented to demonstrate that the SiZerSS and the SiZerLL (the original local linear version of SiZer) often give similar performance in exploring data structure but they can not replace each other completely. Marron’s research was supported by the Dept. of Stat. and Appl. Prob., National Univ. of Singapore, and by the National Science Foundation Grant DMS-9971649. Zhang’s research was supported by the National Univ. of Singapore Academic Research grant R-155-000-023-112. The Editor, the Associate Editor, and the referees are appreciated for their invaluable comments and suggestions that help improve the article significantly.     

Inequalities for polynomial splines

We establish exact estimates for the variation on a period of the derivative s ^(r)(t) of a periodic polynomial spline s(t) of degree r and defect 1 with respect to a fixed partition of [0, 2π) under the condition that , where X=C or L ₁     

Towards existence of piecewise Chebyshevian B-spline bases

The paper addresses the problem of how to ensure existence of blossoms in the context of piecewise spaces built from joining different extended Chebyshev spaces by means of connection matrices. The interest of this issue lies in the fact that existence of blossoms is equivalent to existence of B-spline bases in all associated spline spaces. As is now classical, blossoms are defined in a geometric way by means of intersections of osculating flats. In such a piecewise context, intersecting a number of osculating flats is a tough proposition. In the present paper, we show that blossoms exist if an only if Bézier points exist, which significantly simplifies the problem. Existence of blossoms also proves to be equivalent to existence of Bernstein bases. In order to establish the latter results, we start by extending to the piecewise context some results which are classical for extended Chebyshev spaces. AMS subject classification 65D17, 65D07     

A few remarks on recurrence relations for geometrically continuous piecewise Chebyshevian B-splines

This works complements a recent article (Mazure, J. Comp. Appl. Math. 219(2):457–470, 2008) in which we showed that T. Lyche’s recurrence relations for Chebyshevian B-splines (Lyche, Constr. Approx. 1:155–178, 1985) naturally emerged from blossoms and their properties via de Boor type algorithms. Based on Chebyshevian divided differences, T. Lyche’s approach concerned splines with all sections in the same Chebyshev space and with ordinary connections at the knots. Here, we consider geometrically continuous piecewise Chebyshevian splines, namely, splines with sections in different Chebyshev spaces, and with geometric connections at the knots. In this general framework, we proved in (Mazure, Constr. Approx. 20:603–624, 2004) that existence of B-spline bases could not be separated from existence of blossoms. Actually, the present paper enhances the powerfulness of blossoms in which not only B-splines are inherent, but also their recurrence relations. We compare this fact with the work by G. Mühlbach and Y. Tang (Mühlbach and Tang, Num. Alg. 41:35–78, 2006) who obtained the same recurrence relations via generalised Chebyshevian divided differences, but only under some total positivity assumption on the connexion matrices. We illustrate this comparison with splines with four-dimensional sections. The general situation addressed here also enhances the differences of behaviour between B-splines and the functions of smaller and smaller supports involved in the recurrence relations.     

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.     

Calibration relations for nonpolynomial splines

Nonpolynomial (X, A, ϕ)-splines of the third order and the special case of B _ϕ-splines of class C² are studied. For such splines calibration relations are obtained, owing to which the coordinate splines on the original grid is represented in terms of the coordinate splines on a refined grid. A nonlinear mapping (ℝ⁴)⁹ ↦ ℝ⁴ and locally orthogonal chains of vectors are used for this purpose. Bibliography: 22 titles. __________ Translated from Problemy Matematicheskogo Analiza, No. 34, 2006, pp. 39–54.     

The Budan-Fourier theorem for splines

The Budan-Fourier theorem for polynomials connects the number of zeros in an interval with the number of sign changes in the sequence of successive derivatives evaluated at the end-points. An extension is offered to splines with knots of arbitrary multiplicities, in which case the connection involves the number of zeros of the highest derivative. The theorem yields bounds on the number of zeros of splines and is a valuable tool in spline interpolation and approximation with boundary conditions.     

Optimal design for smoothing splines

In the common nonparametric regression model we consider the problem of constructing optimal designs, if the unknown curve is estimated by a smoothing spline. A special basis for the space of natural splines is introduced and the local minimax property for these splines is used to derive two optimality criteria for the construction of optimal designs. The first criterion determines the design for a most precise estimation of the coefficients in the spline representation and corresponds to D-optimality, while the second criterion is the G-optimality criterion and corresponds to an accurate prediction of the curve. Several properties of the optimal designs are derived. In general, D- and G-optimal designs are not equivalent. Optimal designs are determined numerically and compared with the uniform design.     

Calibration relations for nonpolynomial splines

We construct wavelet decompositions and the corresponding decomposition – reconstruction algorithms in the case of an infinite flow (a grid on an open interval) and a finite flow (a grid on a segment) for a space of Lagrange type splines (in general, not polynomial). Bibliography: 11 titles.     

Tight linear envelopes for splines

Summary. A sharp bound on the distance between a spline and its B-spline control polygon is derived. The bound yields a piecewise linear envelope enclosing spline and polygon. This envelope is particularly simple for uniform splines and splines in Bernstein-Bézier form and shrinks by a factor of 4 for each uniform subdivision step. The envelope can be easily and efficiently implemented due to its explicit and constructive nature. Received February 12, 1999 / Revised version received October 15, 1999 / Published online May 4, 2001