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.     

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.     

Normalized trivariate B-splines on Worsey-Piper split and quasi-interpolants

In this work, we give an algorithm for constructing a normalized B-spline basis over a Worsey-Piper split of a bounded domain of ℝ³. These B-splines are all positive, have local support and form a partition of unity. Therefore, they can be used for constructing local approximants and for many other applications in CAGD. We also introduce the Worsey-Piper B-spline representation of C ¹ quadratic polynomials or splines in terms of their polar forms. Then, we use this B-representation for constructing several quasi-interpolants which have an optimal approximation order.     

A Numerical Algorithm for Cubature by Bivariate Splines on Nonuniform Partitions

We have studied the numerical integration 2D based on bivariate C ¹ local polynomial splines with a criss–cross triangulation of nonuniform rectangular partition. We have constructed the cubature formula and proved the convergence properties and error bounds. The paper includes some numerical tests that illustrate the performance of the corresponding algorithm. In the appendix there are explicit expressions of the quadratic polynomial restrictions of the B-splines related to every triangular cell.     

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.     

Numerical integration based on bivariate quadratic spline quasi-interpolants on bounded domains

In this paper we generate and study new cubature formulas based on spline quasi-interpolants defined as linear combinations of C ¹ bivariate quadratic B-splines on a rectangular domain Ω, endowed with a non-uniform criss-cross triangulation, with discrete linear functionals as coefficients. Such B-splines have their supports contained in Ω and there is no data point outside this domain. Numerical results illustrate the methods.     

On uniform Lebesgue constants of local exponential splines with equidistant knots

For a linear differential operator L _r of arbitrary order r with constant coefficients and real pairwise different roots of the characteristic polynomial, we study Lebesgue constants (the norms of linear operators from C to C) of local exponential splines corresponding to this operator with a uniform arrangement of knots; such splines were constructed by the authors in earlier papers. In particular, for the third-order operator L ₃ = D(D ² ? β ²) (β > 0), we find the exact values of Lebesgue constants for two types of local splines and compare these values with Lebesgue constants of exponential interpolation splines.     

On the Interpolation by Discrete Splines with Equidistant Nodes

In this paper we consider equidistant discrete splines S(j), j , which may grow as O(|j|^s) as |j|→∞. Such splines are relevant for the purposes of digital signal processing. We give the definition of the discrete B-splines and describe their properties. Discrete splines are defined as linear combinations of shifts of the B-splines. We present a solution to the problem of discrete spline cardinal interpolation of the sequences of power growth and prove that the solution is unique within the class of discrete splines of a given order.     

Convergence and Smoothness of Nonlinear Lane–Riesenfeld Algorithms in the Functional Setting

We investigate the Lane–Riesenfeld subdivision algorithm for uniform B-splines, when the arithmetic mean in the various steps of the algorithm is replaced by nonlinear, symmetric, binary averaging rules. The averaging rules may be different in different steps of the algorithm. We review the notion of a symmetric binary averaging rule, and we derive some of its relevant properties. We then provide sufficient conditions on the nonlinear binary averaging rules used in the Lane–Riesenfeld algorithm that ensure the convergence of the algorithm to a continuous function. We also show that, when the averaging rules are C ² with uniformly bounded second derivatives, then the limit is a C ¹ function. A canonical family of nonlinear, symmetric averaging rules, the p-averages, is presented, and the Lane–Riesenfeld algorithm with these averages is investigated.     

Constructive methods in convexC 2 interpolation using quartic splines

Using quartic splines on refined grids, we present a method for convexity preservingC ² interpolation which is successful for all strictly convex data sets. In the first stage, one suitable additional knot in each subinterval of the original data grid is fixed dependent on the given data values. In the second stage, a visually pleasant interpolant is selected by minimizing an appropriate choice functional.     

Cubic Splines with Minimal Norm

Natural cubic interpolatory splines are known to have a minimal L ₂-norm of its second derivative on the C ² (or W ₂ ² ) class of interpolants. We consider cubic splines which minimize some other norms (or functionals) on the class of interpolatory cubic splines only. The cases of classical cubic splines with defect one (interpolation of function values) and of Hermite C ¹ splines (interpolation of function values and first derivatives) with spline knots different from the points of interpolation are discussed.     

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.      

Positive interpolation with rational splines

A method is presented for the construction of positive rational splines of continuity classC ².     

Local convergence in a generalized Fermat-Weber problem

In the Fermat-Weber problem, the location of a source point in ^N is sought which minimizes the sum of weighted Euclidean distances to a set of destinations. A classical iterative algorithm known as the Weiszfeld procedure is used to find the optimal location. Kuhn proves global convergence except for a denumerable set of starting points, while Katz provides local convergence results for this algorithm. In this paper, we consider a generalized version of the Fermat-Weber problem, where distances are measured by anl _p norm and the parameterp takes on a value in the closed interval [1, 2]. This permits the choice of a continuum of distance measures from rectangular (p=1) to Euclidean (p=2). An extended version of the Weiszfeld procedure is presented and local convergence results obtained for the generalized problem. Linear asymptotic convergence rates are typically observed. However, in special cases where the optimal solution occurs at a singular point of the iteration functions, this rate can vary from sublinear to quadratic. It is also shown that for sufficiently large values ofp exceeding 2, convergence of the Weiszfeld algorithm will not occur in general.     

Shape preserving histogram approximation

We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of quadratic-like splines with variable degrees. For the analogous bivariate problem we introduce a new scheme based on the Boolean sum of univariate B-splines and show that for a proper choice of the degrees, the splines are positive and satisfy local monotonicity constraints.     

Monotone and convex interpolation by weighted quadratic splines

In this paper we discuss the design of algorithms for interpolating discrete data by using weighted C ¹ quadratic splines in such a way that the monotonicity and convexity of the data are preserved. The analysis culminates in two algorithms with automatic selection of the shape control parameters: one to preserve the data monotonicity and other to retain the data convexity. Weighted C ¹ quadratic B-splines and control point approximation are also considered.     

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.     

D p spaces on bounded symmetric domains ofC n

In this paper, the spaceD ^p(Ω) of functions holomorphic on bounded symmetric domain ofC ⁿ is defined. We prove thatH ^p(Ω)⊂D ^p(Ω) if 0<p≤2, andD ^p(Ω)⊂H ^p(Ω) ifp≥2, and both the inclusions are proper. Further, we find that some theorems onH ^p(Ω) can be extended to a wider classD ^p(Ω) for 0<p≤2.     

Bézier curves and interpolation in Riemannian manifolds

In a connected Riemannian manifold, generalised Bézier curves are C^∞ curves defined by a generalisation, in which line segments are replaced by minimal geodesics, of the classical de Casteljau algorithm. As in Euclidean space, these curves join their first and last control points. We compute the endpoint velocities and (covariant) accelerations of a generalised Bézier curve of arbitrary degree and use the formulae to express the curve's control points in terms of these quantities. These results allow generalised Bézier curves to be pieced together into C² splines, and thereby allow C² interpolation of a sequence of data points. For the case of uniform splines in symmetric spaces, we show that C² continuity is equivalent to a simple relationship, involving the global symmetries at knot points, between the control points of neighbouring curve segments. We also present some examples in hyperbolic 2-space.     

Convergence of Derivatives of Optimal Nodal Splines

Optimal nodal spline interpolantsWfof ordermwhich have local support can be used to interpolate a continuous functionfat a set of mesh points. These splines belong to a spline space with simple knots at the mesh points as well as atm−2 arbitrary points between any two mesh points and they reproduce polynomials of orderm. It has been shown that, for a sequence of locally uniform meshes, these splines converge uniformly for anyfCas the mesh norm tends to zero. In this paper, we derive a set of sufficient conditions on the sequence of meshes for the uniform convergence ofD^jWftoD^jfforfC^sandj=1, …, s<m. In addition we give a bound forD^rWfwiths<r<m. Finally, we use optimal nodal spline interpolants for the numerical evaluation of Cauchy principal value integrals.