Error estimates in W 2,∞-semi-norms for discrete interpolating D 2-splines

We derive error estimates in W^2,∞-semi-norms for multivariate discrete D²-splines that interpolate an unknown function at the vertices of given triangulations. These results are widely based on the construction of approximation operators and linear projectors onto piecewise polynomial spaces having weakly stable local bases.     

Radial basis functions under tension

We discuss multivariate interpolation with some radial basis function, called radial basis function under tension (RBFT). The RBFT depends on a positive parameter which provides a convenient way of controlling the behavior of the interpolating surface. We show that our RBFT is conditionally positive definite of order at least one and give a construction of the native space, namely a semi-Hilbert space with a semi-norm, minimized by such an interpolant. Error estimates are given in terms of this semi-norm and numerical examples illustrate the behavior of interpolating surfaces.     

Approximation by interpolating variational splines

In this paper we present an approximation problem of parametric curves and surfaces from a Lagrange or Hermite data set. In particular, we study an interpolation problem by minimizing some functional on a Sobolev space that produces the new notion of interpolating variational spline. We carefully establish a convergence result. Some specific cases illustrate the generality of this work.     

Convex interval interpolation with cubic splines

A necessary and sufficient criterion is presented under which the problem of the convex interval interpolation with cubicC ¹-splines has at least one solution. The criterion is given as an algorithm which turns out to be effective.Dedicated to Professor Julius Albrecht on the occasion of his 60th birthday.     

Error bounds for minimal energy bivariate polynomial splines

Summary. We derive error bounds for bivariate spline interpolants which are calculated by minimizing certain natural energy norms. Received March 28, 2000 / Revised version received June 23, 2000 / Published online March 8, 2002 RID="*" ID="*" Supported by the National Science Foundation under grant DMS-9870187 RID="**" ID="**" Supported by the National Science Foundation under grant DMS-9803340 and by the Army Research Office under grant DAAD-19-99-1-0160     

From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms

In this work we construct three novel families of approximating subdivision schemes that generate piecewise exponential polynomials and we show how to convert these into interpolating schemes of great interest in curve design for their ability to reproduce important analytical shapes and to provide highly smooth limit curves with a controllable tension.     

A shape preserving area true approximation of histogram by rational splines

For a given histogram, we consider an application of a simple rational spline to a shape preserving area true approximation of the histogram. An algorithm for determination of the spline is as easy as one with a quadratic polynomial spline, while the latter does not always preserve the shape of the histogram. Some numerical examples are given at the end of the paper.     

Constrained approximation by splines with free knots

In this paper, a method that combines shape preservation and least squares approximation by splines with free knots is developed. Besides the coefficients of the spline a subset of the knot sequence, the so-calledfree knots, is included in the optimization process resulting in a nonlinear least squares problem in both the coefficients and the knots. The original problem, a special case of aconstrained semi-linear least squares problem, is reduced to a problem that has only the knots of the spline as variables. The reduced problem is solved by a generalized Gauss-Newton method. Special emphasise is given to the efficient computation of the residual function and its Jacobian. Dedicated to our colleague and teacher Prof. Dr. J. W. Schmidt on the occasion of his 65th birthday Research of the first author was supported by Deutsche Forschungsgemeinschaft under grant Schm 968/2-1,2-2.     

Thinning algorithms for scattered data interpolation

Multistep interpolation of scattered data by compactly supported radial basis functions requires hierarchical subsets of the data. This paper analyzes thinning algorithms for generating evenly distributed subsets of scattered data in a given domain in ℝ ^d .     

S-convex,monotone, and positive interpolation with rational bicubic splines of C2-continuity

In this paper we deal with shape preserving interpolation of data sets given on rectangular grids. The aim is to show that there exist spline interpolants of the continuity classC ² which areS-convex, monotone, or positive if the data sets have these properties. This is done by using particular rational bicubic splines defined on the grids introduced by the data. Interpolants of the desired type can be constructed by a simple search procedure.     

Error estimates of quasi-interpolation and its derivatives

Quasi-interpolation of radial basis functions on finite grids is a very useful strategy in approximation theory and its applications. A notable strongpoint of the strategy is to obtain directly the approximants without the need to solve any linear system of equations. For radial basis functions with Gaussian kernel, there have been more studies on the interpolation and quasi-interpolation on infinite grids. This paper investigates the approximation by quasi-interpolation operators with Gaussian kernel on the compact interval. The approximation errors for two classes of function with compact support sets are estimated. Furthermore, the approximation errors of derivatives of the approximants to the corresponding derivatives of the approximated functions are estimated. Finally, the numerical experiments are presented to confirm the accuracy of the approximations.     

Bases for kernel-based spaces

Since it is well-known (De Marchi and Schaback (2001) [4]) that standard bases of kernel translates are badly conditioned while the interpolation itself is not unstable in function space, this paper surveys the choices of other bases. All data-dependent bases turn out to be defined via a factorization of the kernel matrix defined by these data, and a discussion of various matrix factorizations (e.g. Cholesky, QR, SVD) provides a variety of different bases with different properties. Special attention is given to duality, stability, orthogonality, adaptivity, and computational efficiency. The “Newton” basis arising from a pivoted Cholesky factorization turns out to be stable and computationally cheap while being orthonormal in the “native” Hilbert space of the kernel. Efficient adaptive algorithms for calculating the Newton basis along the lines of orthogonal matching pursuit conclude the paper.     

Identities for piecewise polynomial spaces determined by connection matrices

Summary TwoB-spline results — Marsden's identity and the de Boor-Fix dual functionals — are extended to geometrically continuous curves determined by connection matrices.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.     

On near-best discrete quasi-interpolation on a four-directional mesh

Spline quasi-interpolants are practical and effective approximation operators. In this paper, we construct QIs with optimal approximation orders and small infinity norms called near-best discrete quasi-interpolants which are based on Ω-splines, i.e. B-splines with octagonal supports on the uniform four-directional mesh of the plane. These quasi-interpolants are exact on some space of polynomials and they minimize an upper bound of their infinity norms depending on a finite number of free parameters. We show that this problem has always a solution, in general nonunique. Concrete examples of such quasi-interpolants are given in the last section.     

Positive interpolation with rational splines

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

A tension approach to controlling the shape of cubic spline surfaces on FVS triangulations

We propose a parametric tensioned version of the FVS macro-element to control the shape of the composite surface and remove artificial oscillations, bumps and other undesired behaviour. In particular, this approach is applied to C¹ cubic spline surfaces over a four-directional mesh produced by two-stage scattered data fitting methods.     

Convex interval interpolation with cubic splines,II

The problem of convex interval interpolation with cubicC ¹-splines has an infinite number of solutions, if it is solvable at all. For selecting one of the solutions a regularized mean curvature is minimized. The arising finite dimensional constrained program is solved numerically by means of a dualization approach.Dedicated to Professor Julius Albrecht on the occasion of his 65th birthday.     

On orders of approximation of plane curves by parametric cubic splines

The aim of the present paper is to show that the convergence rate of the parametric cubic spline approximation of a plane curve is of order four instead of order three. For the first and second derivatives, the rates are of order three and two, respectively. Finally some numerical examples are given to illustrate the predicted error behaviour.     

A nodal spline interpolant for the Gregory rule of even order

Summary The Gregory rule is a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order. In the literature, the methods of constructing the Gregory rule have, in contrast to Newton-Cotes quadrature,not been based on the integration of an interpolant. In this paper, after first characterizing an even-order Gregory interpolant by means of a generalized Lagrange interpolation operator, we proceed to explicitly construct such an interpolant by employing results from nodal spline interpolation, as established in recent work by the author and C.H. Rohwer. Nonoptimal order error estimates for the Gregory rule of even order are then easily obtained.     

Fortran subroutines for B-nets of box splines on three- and four-directional meshes

We describe an algorithm to compute the B-nets of bivariate box splines on a three-or four-directional mesh. Two pseudo Fortran programs for those B-nets are given.Research supported by a Faculty Grant From the University of Utah Research Committee.