The -approximation order of surface spline interpolation

We show that if the open, bounded domain has a sufficiently smooth boundary and if the data function is sufficiently smooth, then the -norm of the error between and its surface spline interpolant is ( ), where and is an integer parameter specifying the surface spline. In case , this lower bound on the approximation order agrees with a previously obtained upper bound, and so we conclude that the -approximation order of surface spline interpolation is .

     

Smooth-curve interpolation: A generalized spline-fit procedure

A method is presented for finding the smoothest curve through a set of data points. Smoothest refers to the equilibrium, or minimum-energy configuration of an ideal elastic beam constrained to pass through the data points. The formulation of the smoothest curve is seen to involve a multivariable boundary-value minimization problem which makes use of a numerical solution of the beam non-linear differential equation. The method is shown to offer considerable improvement over the spline technique for smooth-curve interpolation.     

A degree by degree recursive construction of Hermite spline interpolants

Based on the classical Hermite spline interpolant _H2n−1$H_{2n-1}$, which is the piecewise interpolation polynomial of class Cⁿ⁻¹$C^{n-1}$ and degree 2n−1$2n-1$, a piecewise interpolation polynomial _H2n$H_{2n}$ of degree 2n$2n$ is given. The formulas for computing _H2n$H_{2n}$ by _H2n−1$H_{2n-1}$ and computing _H2n+1$H_{2n+1}$ by _H2n$H_{2n}$ are shown. Thus a simple recursive method for the construction of the piecewise interpolation polynomial set {_Hj}$\left\{H_j\right\}$ is presented. The piecewise interpolation polynomial _H2n$H_{2n}$ satisfies the same interpolation conditions as the interpolant _H2n−1$H_{2n-1}$, and is an optimal approximation of the interpolant _H2n+1$H_{2n+1}$. Some interesting properties are also proved.     

Convergence of local variational spline interpolation

In this paper we first revisit a classical problem of computing variational splines. We propose to compute local variational splines in the sense that they are interpolatory splines which minimize the energy norm over a subinterval. We shall show that the error between local and global variational spline interpolants decays exponentially over a fixed subinterval as the support of the local variational spline increases. By piecing together these locally defined splines, one can obtain a very good C⁰ approximation of the global variational spline. Finally we generalize this idea to approximate global tensor product B-spline interpolatory surfaces.     

On the choice of the initial value of a quadratic spline in positive interpolation

Any quadratic spline with coinciding interpolating points and breakpoints can be uniquely determined by one initial condition. We examine how to choose the initial value in positive interpolation by using a norm of the spline. Monotone interpolation is also considered. The results are illuminated by numerical examples and by an application.     

Numerical experiments on the condition number of the interpolation matrices for radial basis functions

Through numerical experiments, we examine the condition numbers of the interpolation matrix for many species of radial basis functions (RBFs), mostly on uniform grids. For most RBF species that give infinite order accuracy when interpolating smooth f(x)—Gaussians, sech's and Inverse Quadratics—the condition number κ(α,N) rapidly asymptotes to a limit κasymp(α) that is independent of N and depends only on α, the inverse width relative to the grid spacing. Multiquadrics are an exception in that the condition number for fixed α grows as N². For all four, there is growth proportional to an exponential of 1/α (1/α² for Gaussians). For splines and thin-plate splines, which contain no width parameter, the condition numbers grows asymptotically as a power of N—a large power as the order of the RBF increases. Random grids typically increase the condition number (for fixed RBF width) by orders of magnitude. The quasi-random, low discrepancy Halton grid may, however, have a lower condition number than a uniform grid of the same size.     

Approximation order of bivariate spline interpolation for arbitrary smoothness

By using the algorithm of Nürnberger and Riessinger (1995), we construct Hermite interpolation sets for spaces of bivariate splines S_q^r(Δ¹) of arbitrary smoothness defined on the uniform type triangulations. It is shown that our Hermite interpolation method yields optimal approximation order for q 3.5r + 1. In order to prove this, we use the concept of weak interpolation and arguments of Birkhoff interpolation.     

A fast algorithm for multivariate Hermite interpolation

Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to compute the vanishing ideal I （the set of polynomials satisfying all the homogeneous interpolation conditions are zero） and then use a complete residue system modulo I as the interpolation basis. Thus the interpolation problem can be converted into solving a linear equation system. A generic algorithm was presented in [18], which is a generalization of BM algorithm [22] and the complexity is O（τ^3） where r represents the number of the interpolation conditions. In this paper we derive a method to obtain the residue system directly from the relative position of the points and the corresponding derivative conditions （presented by lower sets） and then use fast GEPP to solve the linear system with O（（τ ＋ 3）τ^2） operations, where τ is the displacement-rank of the coefficient matrix. In the best case τ = 1 and in the worst case τ = [τ/n], where n is the number of variables.     

Optimal shift parameters for periodic spline interpolation

Using the exponential Euler spline, restricted on the unit circle, we sketch a unified approach to the periodic spline interpolation with shifted interpolation nodes. Mainly we are interested in the optimal choice of the shift parameter such that the corresponding interpolatory matrix possesses minimal condition or such that the related interpolation operator has minimal norm. We show that =0 is optimal in both cases. This improves known results of Merz, Reimer-Siepmann and Richards.     

Cardinal spline interpolation from

Let be the discrete Hardy space, consisting of those sequences , such that , where , , is the discrete Hilbert transform of . For a sequence , let be the unique cardinal spline of degree interpolating to at the integers. The norm of this operator, , is called a Lebesgue constant from to , and it was proved that .

It is proved in this paper that

     

-error estimates for ``shifted' surface spline interpolation on Sobolev space

The accuracy of interpolation by a radial basis function is usually very satisfactory provided that the approximant is reasonably smooth. However, for functions which have smoothness below a certain order associated with the basis function , no approximation power has yet been established. Hence, the purpose of this study is to discuss the -approximation order ( ) of interpolation to functions in the Sobolev space with \max(0,d/2-d/p)$">. We are particularly interested in using the ``shifted' surface spline, which actually includes the cases of the multiquadric and the surface spline. Moreover, we show that the accuracy of the interpolation method can be at least doubled when additional smoothness requirements and boundary conditions are met.

     

Intertwining unisolvent arrays for multivariate Lagrange interpolation

Generalizing a classical idea of Biermann, we study a way of constructing a unisolvent array for Lagrange interpolation in C^n+m out of two suitably ordered unisolvent arrays respectively in Cⁿ and C^m. For this new array, important objects of Lagrange interpolation theory (fundamental Lagrange polynomials, Newton polynomials, divided difference operator, vandermondian, etc.) are computed. AMS subject classification 41A05, 41A63     

On Radon’s recipe for choosing correct sites for multivariate polynomial interpolation

A class of sets correct for multivariate polynomial interpolation is defined and verified, and shown to coincide with the collection of all correct sets constructible by the recursive application of Radon’s recipe, and a recent concrete recipe for correct sets is shown to produce elements in that class.     

Chordal cubic spline interpolation is fourth-order accurate

^** Email: michaelf{at}ifi.uio.no It is well known that complete cubic spline interpolation offunctions with four continuous derivatives is fourth-order accurate.In this paper we show that this kind of interpolation, whenused to construct parametric spline curves through sequencesof points in any space dimension, is again fourth-order accurateif the parameter intervals are chosen by chord length. We alsoshow how such chordal spline interpolants can be used to approximatethe arc-length derivatives of a curve and its length.     

Error estimates for discrete spline interpolation: Quintic and biquintic splines

In this paper we shall develop a class of discrete spline interpolates in one and two independent variables. Further, explicit error bounds in _?∞${?}_{\infty }$ norm are derived for the quintic and biquintic discrete spline interpolates. We also present some numerical examples to illustrate the results obtained.     

A deficient spline function approximation to fourth-order differential equations

An approximate spline solution is developed for the initial value problem of a fourth-order ordinary differential equation. The approximation is based on deficient spline polynomials of degree M = 8 and deficiency 4. The existence and uniqueness of the solution, which satisfies a Lipschitz condition, are proved. The consistency, stability, and consequently convergence of the solution are established. Furthermore, the method is proved to be of order 9, and the errors are limited by the relation S⁽ⁱ⁾(x) − y⁽ⁱ⁾(x) = O(h^{9 − i}), I = 0(1)8.     

A note on stability results for scattered data interpolation on Euclidean spheres

The present work considers the interpolation of the scattered data on the d-sphere by spherical polynomials. We prove bounds on the conditioning of the problem which rely only on the separation distance of the sampling nodes and on the degree of polynomials being used. To this end, we establish a packing argument for well separated sampling nodes and construct strongly localized polynomials on spheres. Numerical results illustrate our theoretical findings. Dedicated to Professor Manfred Tasche on the occasion of his 65th birthday.     

A weighted interpolation inequality with variable exponent of the Nirenberg-Gagliardo kind

We establish an inequality of the Nirenberg-Gagliardo kind for functions belonging to some degenerate Sobolev space with variable exponents.     

A new multivariate spline based on mixed partial derivatives and its finite element approximation

We present a new multivariate spline using mixed partial derivatives. We show the existence and uniqueness of the proposed multivariate spline problem, and propose a simple finite element approximation.