B-splines with homogenized knots

The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.     

B-splines with homogenized knots

The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.     

Basis of splines associated with some singular differential operators

Functions being piecewise in Ker (D ^k DpD) are a special case of Chebyshev splines having one nontrivial weight and also a special case of singular splines. An algorithm is designed which enables calculating with related B-splines and their derivatives. Ifp(t) is approximated by a piecewise constant, an interesting recurrence for calculating with polynomial B-splines is obtained.     

A shape-preserving approximation by weighted cubic splines

This paper addresses new algorithms for constructing weighted cubic splines that are very effective in interpolation and approximation of sharply changing data. Such spline interpolations are a useful and efficient tool in computer-aided design when control of tension on intervals connecting interpolation points is needed. The error bounds for interpolating weighted splines are obtained. A method for automatic selection of the weights is presented that permits preservation of the monotonicity and convexity of the data. The weighted B-spline basis is also well suited for generation of freeform curves, in the same way as the usual B-splines. By using recurrence relations we derive weighted B-splines and give a three-point local approximation formula that is exact for first-degree polynomials. The resulting curves satisfy the convex hull property, they are piecewise cubics, and the curves can be locally controlled with interval tension in a computationally efficient manner.     

Computing ECT-B-splines recursively

ECT-spline curves for sequences of multiple knots are generated from different local ECT-systems via connection matrices. Under appropriate assumptions there is a basis of the space of ECT-splines consisting of functions having minimal compact supports, normalized to form a nonnegative partition of unity. The basic functions can be defined by generalized divided differences [24]. This definition reduces to the classical one in case of a Schoenberg space. Under suitable assumptions it leads to a recursive method for computing the ECT-B-splines that reduces to the de Boor–Mansion–Cox recursion in case of ordinary polynomial splines and to Lyche's recursion in case of Tchebycheff splines. For sequences of simple knots and connection matrices that are nonsingular, lower triangular and totally positive the spline weights are identified as Neville–Aitken weights of certain generalized interpolation problems. For multiple knots they are limits of Neville–Aitken weights. In many cases the spline weights can be computed easily by recurrence. Our approach covers the case of Bézier-ECT-splines as well. They are defined by different local ECT-systems on knot intervals of a finite partition of a compact interval [a,b] connected at inner knots all of multiplicities zero by full connection matrices A ^[i] that are nonsingular, lower triangular and totally positive. In case of ordinary polynomials of order n they reduce to the classical Bézier polynomials. We also present a recursive algorithm of de Boor type computing ECT-spline curves pointwise. Examples of polynomial and rational B-splines constructed from given knot sequences and given connection matrices are added. For some of them we give explicit formulas of the spline weights, for others we display the B-splines or the B-spline curves. *Supported in part by INTAS 03-51-6637.     

Multiresolution exponential B-splines and singularly perturbed boundary problem

The paper considers how cardinal exponential B-splines can be applied in solving singularly perturbed boundary problems. The exponential nature and the multiresolution property of these splines are essential for an accurate simulation of a singular behavior of some differential equation solutions. Based on the knowledge that the most of exponential B-spline properties coincide with those of polynomial splines (smoothness, compact support, positivity, partition of unity, reconstruction of polynomials, recursion for derivatives), one novel algorithm is proposed. It merges two well known approaches for solving such problems, fitted operator and fitted mesh methods. The exponential B-spline basis is adapted for an interval because a considered problem is solved on a bounded domain.      

Novel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial blossoming

We introduce the G-blossom of a polynomial by altering the diagonal property of the classical blossom, replacing the identity function by arbitrary linear functions G=G(t). By invoking the G-blossom, we construct G-Bernstein bases and G-Bézier curves and study their algebraic and geometric properties. We show that the G-blossom provides the dual functionals for the G-Bernstein basis functions and we use this dual functional property to prove that G-Bernstein basis functions form a partition of unity and satisfy a Marsden identity. We also show that G-Bézier curves share several other properties with classical Bézier curves, including affine invariance, interpolation of end points, and recursive algorithms for evaluation and subdivision. We investigate the effect of the linear functions G on the shape of the corresponding G-Bézier curves, and we derive some necessary and sufficient conditions on the linear functions G which guarantee that the corresponding G-Bézier curves are of Pólya type and variation diminishing. Finally we prove that the control polygons generated by recursive subdivision converge to the original G-Bézier curve, and we derive the geometric rate of convergence of this algorithm.     

de Boor-Fix dual functionals and algorithms for Tchebycheffian B-spline curves

The de Boor-Fix dual functionals are a potent tool for deriving results about piecewise polynomial B-spline curves. In this paper we extend these functionals to Tchebycheffian B-spline curves and then use them to derive fundamental algorithms that are natural generalizations of algorithms for piecewise polynomial B-spline algorithms. Then, as a further example of the utility of this approach, we introduce “geometrically continuous Tchebycheffian spline curves,” and show that a further generalization works for them as well.     

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.     

Quantum complexity of the approximation for the classes B(Wp ([0, 1])) and B(Hp ([0, 1]))

We study the approximation of functions from anisotropic Sobolev classes B(W^r_p([0,1]d)) and Hölder-Nikolskii classes B(H^r_p([0,1]d)) in the L_q([0,1]d) norm with q ≤ p in the quantum model of computation. We determine the quantum query complexity of this problem up to logarithmic factors. It shows that the quantum algorithms are significantly better than the classical deterministic or randomized algorithms.     

An orthogonal basis for non-uniform algebraic-trigonometric spline space

Non-uniform algebraic-trigonometric B-splines shares most of the properties as those of the usual polynomial B-splines. But they are not orthogonal. We construct an orthogonal basis for the n-order(n ≥ 3) algebraic-trigonometric spline space in order to resolve the theoretical problem that there is not an explicit orthogonal basis in the space by now. Motivated by the Legendre polynomials, we present a novel approach to define a set of auxiliary functions,which have simple and explicit expressions. Then the proposed orthogonal splines are given as the derivatives of these auxiliary functions.     

Super spline spaces of smoothnessr and degreed≥3r+2

The problem of computing the dimension of spaces of splines whose elements are piecewise polynomials of degreed withr continuous derivatives globally has attracted a great deal of attention recently. We contribute to this theory by obtaining dimension formulae for certain spaces of super splines, including the case where varying amounts of additional smoothness is enforced at each vertex. We also explicitly construct minimally supported bases for the spaces. The main tool is the Bernstein-Bézier method.Communicated by Klaus Höllig.     

On the complexity of the multivariate Sturm–Liouville eigenvalue problem

We study the complexity of approximating the smallest eigenvalue of -Δ+q with Dirichlet boundary conditions on the d-dimensional unit cube. Here Δ is the Laplacian, and the function q is non-negative and has continuous first order partial derivatives. We consider deterministic and randomized classical algorithms, as well as quantum algorithms using quantum queries of two types: bit queries and power queries. We seek algorithms that solve the problem with accuracy . We exhibit lower and upper bounds for the problem complexity. The upper bounds follow from the cost of particular algorithms. The classical deterministic algorithm is optimal. Optimality is understood modulo constant factors that depend on d. The randomized algorithm uses an optimal number of function evaluations of q when d≤2. The classical algorithms have cost exponential in d since they need to solve an eigenvalue problem involving a matrix with size exponential in d. We show that the cost of quantum algorithms is not exponential in d, regardless of the type of queries they use. Power queries enjoy a clear advantage over bit queries and lead to an optimal complexity algorithm.     

Approximation by Discrete GB-Splines

This paper addresses the definition and the study of discrete generalized splines. Discrete generalized splines are continuous piecewise defined functions which meet some smoothness conditions for the first and second divided differences at the knots. They provide a generalization both of smooth generalized splines and of the classical discrete cubic splines. Completely general configurations for steps in divided differences are considered. Direct algorithms are proposed for constructing discrete generalized splines and discrete generalized B-splines (discrete GB-splines for short). Explicit formulae and recurrence relations are obtained for discrete GB-splines. Properties of discrete GB-splines and their series are studied. It is shown that discrete GB-splines form weak Chebyshev systems and that series of discrete GB-splines have a variation diminishing property.     

Elementarym-harmonic cardinal B-splines

We generalize the notion of B-spline to the thin plate splines and to otherd-dimensional polyharmonic splines as defined in [Duchon, [3]]; for regular nets, we give the main properties of these B-splines: Fourier transform, decay when x , stability, integration property, links between B-splines of different orders or of different dimensions and in particular link with the polynomial B-splines, approximation using B-splines... We show that, in some sense, B-splines may be considered as a regularized form of the Dirac distribution.     

Non-uniform exponential tension splines

We describe explicitly each stage of a numerically stable algorithm for calculating with exponential tension B-splines with non-uniform choice of tension parameters. These splines are piecewisely in the kernel of D ²(D ²–p ²), where D stands for ordinary derivative, defined on arbitrary meshes, with a different choice of the tension parameter p on each interval. The algorithm provides values of the associated B-splines and their generalized and ordinary derivatives by performing positive linear combinations of positive quantities, described as lower-order exponential tension splines. We show that nothing else but the knot insertion algorithm and good approximation of a few elementary functions is needed to achieve machine accuracy. The underlying theory is that of splines based on Chebyshev canonical systems which are not smooth enough to be ECC-systems. First, by de Boor algorithm we construct exponential tension spline of class C ¹, and then we use quasi-Oslo type algorithms to evaluate classical non-uniform C ² tension exponential splines.      

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices

We show that many fundamental algorithms and techniques for B-spline curves extend to geometrically continuous splines. The algorithms, which are all related to knot insertion, include recursive evaluation, differentiation, and change of basis. While the algorithms for geometrically continuous splines are not as computationally simple as those for B-spline curves, they share the same general structure. The techniques we investigate include knot insertion, dual functionals, and polar forms; these prove to be useful theoretical tools for studying geometrically continuous splines.     

How to build all Chebyshevian spline spaces good for geometric design?

In the present work we determine all Chebyshevian spline spaces good for geometric design. By Chebyshevian spline space we mean a space of splines with sections in different Extended Chebyshev spaces and with connection matrices at the knots. We say that such a spline space is good for design when it possesses blossoms. To justify the terminology, let us recall that, in this general framework, existence of blossoms (defined on a restricted set of tuples) makes it possible to develop all the classical geometric design algorithms for splines. Furthermore, existence of blossoms is equivalent to existence of a B-spline bases both in the spline space itself and in all other spline spaces derived from it by insertion of knots. We show that Chebyshevian spline spaces good for design can be described by linear piecewise differential operators associated with systems of piecewise weight functions, with respect to which the connection matrices are identity matrices. Many interesting consequences can be drawn from the latter characterisation: as an example, all Chebsyhevian spline spaces good for design can be built by means of integral recurrence relations.     

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

Remarkable Haar spaces of multivariate piecewise polynomials

Some families of Haar spaces in \(\mathbb {R}^{d},~ d\ge 1,\) whose basis functions are d-variate piecewise polynomials, are highlighted. The starting point is a sequence of univariate piecewise polynomials, called Lobachevsky splines, arised in probability theory and asymptotically related to the normal density function. Then, it is shown that d-variate Lobachevsky splines can be expressed as products of Lobachevsky splines. All these splines have simple analytic expressions and subsets of them are suitable for scattered data interpolation, allowing efficient computation and plain error analysis.