On the value of the max-norm of the orthogonal projector onto splines with multiple knots

The supremum over all knot sequences of the max-norm of the orthogonal spline projector is studied with respect to the order k of the splines and their smoothness. It is first bounded from below in terms of the max-norm of the orthogonal projector onto a space of incomplete polynomials. Then, for continuous and for differentiable splines, its order of growth is shown to be .     

Spline interpolation at knot averages

It is well known that when interpolation points coincide with knots, the knot sequence must obey some restriction in order to guarantee the existence and boundedness of the interpolation projector. But, when the interpolation points are chosen to be the knot averages, the corresponding quadratic or cubic spline interpolation projectors are bounded independently of the knot sequence. Based on this fact, de Boor in 1975 made a conjecture that interpolation by splines of orderk at knot averages is bounded for anyk. In this paper we disprove de Boor's conjecture fork 20.Communicated by Wolfgang Dahmen.     

Sequence spaces of spline functions on subsets and l-spaces

Spaces of sequences of bounded linear splines defined on arbitrary subsets of are studied, especially with respect to continuous extensions. An extension problem is solved by establishing a decomposition for the space of spline sequences with respect to the l^∞-space on a corresponding subset of . An application to Zygmund spaces on subsets is presented.     

Gibbs-Wilbraham splines

If a function with a jump discontinuity is approximated in the norm ofL ²[–1,1] by a periodic spline of orderk with equidistant knots, a behavior analogous to the Gibbs-Wilbraham phenomenon for Fourier series occurs. A set of cardinal splines which play the role of the sine integral function of the classical phenomenon is introduced. It is then shown that ask becomes large, the phenomenon for splines approaches the classical phenomenon.Communicated by Ronald A. DeVore.     

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.     

Unimodular eigenvalues, uniformly distributed sequences and linear dynamics

We study increasing sequences of positive integers (nk)_k?1 with the following property: every bounded linear operator T acting on a separable Banach (or Hilbert) space with supk?1‖Tnk‖<∞ has a countable set of unimodular eigenvalues. Whether this property holds or not depends on the distribution (modulo one) of sequences (nkα)_k?1, α∈R, or on the growth of nk+1/nk. Counterexamples to some conjectures in linear dynamics are given. For instance, a Hilbert space operator which is frequently hypercyclic, chaotic, but not topologically mixing is constructed. The situation of C₀-semigroups is also discussed.     

The particular solutions for thin plates resting on Pasternak foundations under arbitrary loadings

Analytical particular solutions of splines and monomials are obtained for problems of thin plate resting on Pasternak foundation under arbitrary loadings, which are governed by a fourth‐order partial differential equation (PDEs). These analytical particular solutions are valuable when the arbitrary loadings are approximated by augmented polyharmonic splines (APS) constructed by splines and monomials. In our derivations, the real coefficient operator in the governing equation is decomposed into two complex coefficient operators whose particular solutions are known in literature. Then, we use the difference trick to recover the analytical particular solutions of the original operator. In addition, we show that the derived particular solution of spline with its first few directional derivatives are bounded as r → 0. This solution procedure may have the potential in obtaining analytical particular solutions of higher order PDEs constructed by products of Helmholtz‐type operators. Furthermore, we demonstrate the usages of these analytical particular solutions by few numerical cases in which the homogeneous solutions are complementarily solved by the method of fundamental solutions (MFS). © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

LM-g splines

As an extension of the notion of an L-g spline, three mathematical structures called LM-g splines of types I, II, and III are introduced. Each is defined in terms of two differential operators the coefficients a_j, J = 0,…, n − 1, and b_i, I = 0,…, m, are sufficiently smooth; and b_m is bounded away from zero on [0, T]. Each of the above types of splines is the solution of an optimization problem more general than the one used in the definition of the L-g spline and hence it is recognized as an entity which is distinct from and more general mathematically than the L-g spline. The LM-g splines introduced here reduce to an L-g spline in the special case in which m = 0 and b₀ = constant ≠ 0. After the existence and uniqueness conditions, characterization, and best approximation properties for the proposed splines are obtained in an appropriate reproducing kernel Hilbert space framework, their usefulness in extending the range of applicability of spline theory to problems in estimation, optimal control, and digital signal processing are indicated. Also, as an extension of recent results in the generalized spline literature, state variable models for the LM-g splines introduced here are exhibited, based on which existing least squares algorithms can be used for the recursive calculation of these splines from the data.     

The convergence of three spline methods for scattered data interpolation and fitting

The convergences of three L₁ spline methods for scattered data interpolation and fitting using bivariate spline spaces are studied in this paper. That is, L₁ interpolatory splines, splines of least absolute deviation, and L₁ smoothing splines are shown to converge to the given data function under some conditions and hence, the surfaces from these three methods will resemble the given data values.     

Cone Spline Surfaces and Spatial Arc Splines – a Sphere Geometric Approach

Basic sphere geometric principles are used to analyze approximation schemes of developable surfaces with cone spline surfaces, i.e., G ¹-surfaces composed of segments of right circular cones. These approximation schemes are geometrically equivalent to the approximation of spatial curves with G ¹-arc splines, where the arcs are circles in an isotropic metric. Methods for isotropic biarcs and isotropic osculating arc splines are presented that are similar to their Euclidean counterparts. Sphere geometric methods simplify the proof that two sufficiently close osculating cones of a developable surface can be smoothly joined by a right circular cone segment. This theorem is fundamental for the construction of osculating cone spline surfaces. Finally, the analogous theorem for Euclidean osculating circular arc splines is given.     

Hilbertian Jamison sequences and rigid dynamical systems

A strictly increasing sequence (nk)_k?0 of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that supk?0‖Tnk‖<+∞, the set of eigenvalues of modulus 1 of T is at most countable. We first give a complete characterization of such sequences. We then turn to the study of rigidity sequences (nk)_k?0 for weakly mixing dynamical systems on measure spaces, and give various conditions, some of which are closely related to the Jamison condition, for a sequence to be a rigidity sequence. We obtain on our way a complete characterization of topological rigidity and uniform rigidity sequences for linear dynamical systems, and we construct in this framework examples of dynamical systems which are both weakly mixing in the measure-theoretic sense and uniformly rigid.     

Three-Convex Approximation by Free Knot Splines in C [0, 1]

A Jackson-type estimate is obtained for the approximation of 3 -convex functions by 3 -convex splines with free knots. The order of approximation is the same as for the Jackson-type estimate for unconstrained approximation by splines with free knots. Shape-preserving free knot spline approximation of k -convex functions, k > 3 , is also considered. January 15, 1996. Date revised: December 9, 1996.     

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.     

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.     

Bivariate Gonarov polynomials and integer sequences

Univariate Gonarov polynomials arose from the Gonarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose order statistics are bounded by a given sequence u.In this paper,we study multivariate Gonarov polynomials,which form a basis of solutions for multivariate Gonarov interpolation problem.We present algebraic and analytic properties of multivariate Gonarov polynomials and establish a combinatorial relation with integer sequences.Explicitly,we prove that multivariate Gonarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in Nk.It leads to a higher-dimensional generalization of parking functions,for which many enumerative results can be derived from the theory of multivariate Gonarov polynomials.     

Degree sequences of <Emphasis Type="Italic">k</Emphasis>-multi-hypertournaments

Let n and k（n ≥ k 〉 1） be two non-negative integers.A k-multi-hypertournament on n vertices is a pair（V,A）,where V is a set of vertices with ｜V｜=n,and A is a set of k-tuples of vertices,called arcs,such that for any k-subset S of V,A contains at least one（at most k!） of the k! k-tuples whose entries belong to S.The necessary and suffcient conditions for a non-decreasing sequence of non-negative integers to be the out-degree sequence（in-degree sequence） of some k-multi-hypertournament are given.     

A constructive approach to nodal splines

In the context of local spline interpolation methods, nodal splines have been introduced as possible fundamental functions by de Villiers and Rohwer in 1988. The corresponding local spline interpolation operator possesses the desirable property of reproducing a large class of polynomials. However, it was remarked that their definition is rather intricate so that it seems desirable to reveal the actual origin of these splines. The real source can be found in the Martensenoperator which can be obtained by two-point Hermite spline interpolation problem posed and proved by Martensen [Darstellung und Entwicklung des Restgliedes der Gregoryschen Quadraturformel mit Hilfe von Spline-Funktionen, Numer. Math. 21(1973)70–80]. On the one hand, we will show how to represent the Hermite Martensen spline recursively and, on the other hand, explicitly in terms of the B-spline by using the famous Marsden identity. Having introduced the Martensenoperator, we will show that the nodal spline interpolation operator can be obtained by a special discretization of the occurring derivatives. We will consider symmetric nodal splines of odd degree that can be obtained by our methods in a natural way.     

Almost perfect powers in consecutive integers (II)

Let k ≥ 4 be an integer. We find all integers of the form by^l where l ≥ 2 and the greatest prime factor of b is at most k (i.e. nearly a perfect power) such that they are also products of k consecutive integers with two terms omitted.     

Monotonicity of quadrature formulae of Gauss type and comparison theorems for monosplines

Summary This paper deals with quadrature formulae of Gauss type corresponding to subspaces of spline functionsS _{m–1, k} of degreem–1 withk fixed knots. We shall show monotonicity of the quadrature formulae for functions which are contained in the so-called convexity cone ofS _m–1,k Moreover, we apply these results to monosplines and establish comparison theorems for these splines.     

Dimension elevation for Chebyshevian splines

Dimension elevation refers to the Chebyshevian version of the classical degree elevation process for polynomials or polynomial splines. In this paper, we consider the case of splines. The original spline space is based on a given Extended Chebsyhev space \mathbbE{\mathbb{E}} contained in another Extended Chebsyhev space \mathbbE^*{\mathbb{E}}^* of dimension increased by one. The original spline space, based on \mathbbE{\mathbb{E}}, is then embedded in a larger one, based on \mathbbE^*\mathbb{E}^*. Thanks to blossoms we show how to compute the new poles of any spline in the original spline space in terms of its initial poles.