Numerically stable algorithm for cycloidal splines

We propose a knot insertion algorithm for splines that are piecewisely in L{1, x, sin x, cos x}. Since an ECC-system on [0, 2π] in this case does not exist, we construct a CCC-system by choosing the appropriate measures in the canonical representation. In this way, a B-basis can be constructed in much the same way as for weighted and tension splines. Thus we develop a corner cutting algorithm for lower order cycloidal curves , though a straightforward generalization to higher order curves, where ECC-systems exist, is more complex. The important feature of the algorithm is high numerical stability and simple implementation. This research was supported by Grant 037-1193086-2771, by the Ministry of science, higher education and sports of the Republic of Croatia.     

Collocation by singular splines

Splines determined by the kernel of the differential operator are known to be useful to solve the singular boundary value problems of the form . One of the most successful methods is the collocation method based on special Chebyshev splines. We investigate the construction of the associated B-splines based on knot-insertion algorithms for their evaluation, and their application in collocation at generalized Gaussian points. Specially, we show how to obtain these points as eigenvalues of a symmetric tridiagonal matrix of order k. This research was supported by Grant 037-1193086-2771, by the Ministry of science, education and sports of the Republic of Croatia.     

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.     

On discrete hyperbolic tension splines

A hyperbolic tension spline is defined as the solution of a differential multipoint boundary value problem. A discrete hyperbolic tension spline is obtained using the difference analogues of differential operators; its computation does not require exponential functions, even if its continuous extension is still a spline of hyperbolic type. We consider the basic computational aspects and show the main features of this approach.     

Blossoming stories

We review the main properties of blossoms along with their important repercussions in all aspects of geometric design. Not only are they an elegant and efficient tool to express all classical algorithms, but they are also a fundamental concept, as proven by the fact that their existence is equivalent to the existence of B-spline bases. AMS subject classification 65D17     

B-Splines with Arbitrary Connection Matrices

We consider a space of Chebyshev splines whose left and right derivatives satisfy linear constraints that are given by arbitrary nonsingular connection matrices. We show that for almost all knot sequences such spline spaces have basis functions whose support is equal to the support of the ordinary B-splines with the same knots. Consequently, there are knot insertion and evaluation algorithms analogous to de Boors algorithm for ordinary splines.     

Isogeometric analysis in advection-diffusion problems: Tension splines approximation

We present a novel approach, within the new paradigm of isogeometric analysis introduced by Hughes et al. (2005) [6], to deal with advection dominated advection-diffusion problems. The key ingredient is the use of Galerkin approximating spaces of functions with high smoothness, as in IgA based on classical B-splines, but particularly well suited to describe sharp layers involving very strong gradients.     

Approximation of vectors fields by thin plate splines with tension

We study a vectorial approximation problem based on thin plate splines with tension involving two positive parameters: one for the control of the oscillations and the other for the control of the divergence and rotational components of the field. The existence and uniqueness of the solution are proved and the solution is explicitly given. As special cases, we study the limit problems as the parameter controlling the divergence and the rotation converges to zero or infinity. The divergence-free and the rotation-free approximation problems are also considered. The convergence in Sobolev space is studied.     

Parallel mesh methods for tension splines

This paper addresses the problem of shape preserving spline interpolation formulated as a differential multipoint boundary value problem (DMBVP for short). Its discretization by mesh method yields a five-diagonal linear system which can be ill-conditioned for unequally spaced data. Using the superposition principle we split this system in a set of tridiagonal linear systems with a diagonal dominance. The latter ones can be stably solved either by direct (Gaussian elimination) or iterative methods (SOR method and finite-difference schemes in fractional steps) and admit effective parallelization. Numerical examples illustrate the main features of this approach.     

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.     

Bieberbach’s conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality

The Bieberbach conjecture about the coefficients of univalent functions of the unit disk was formulated by Ludwig Bieberbach in 1916 [4]. The conjecture states that the coefficients of univalent functions are majorized by those of the Koebe function which maps the unit disk onto a radially slit plane. The Bieberbach conjecture was quite a difficult problem, and it was surprisingly proved by Louis de Branges in 1984 [5] when some experts were rather trying to disprove it. It turned out that an inequality of Askey and Gasper [2] about certain hypergeometric functions played a crucial role in de Branges’ proof. In this article I describe the historical development of the conjecture and the main ideas that led to the proof. The proof of Lenard Weinstein (1991) [72] follows, and it is shown how the two proofs are interrelated. Both proofs depend on polynomial systems that are directly related with the Koebe function. At this point algorithms of computer algebra come into the play, and computer demonstrations are given that show how important parts of the proofs can be automated. This article is dedicated to Dick Askey on occasion of his seventieth birthday. 2000 Mathematics Subject Classification Primary—30C50, 30C35, 30C45, 30C80, 33C20, 33C45, 33F10, 68W30