Overcoming the boundary effects in surface spline interpolation

Surface spline interpolation when the domain is all of R^d isknown to converge much faster to the data function f than inthe case when the domain is the unit ball. This difference isunderstood to be due to boundary effects which, as will be shown,also affect the size of the surface spline's coefficients. Wepropose a modified form of surface spline interpolation which,to a great extent, overcomes these boundary effects. This modifiedsurface spline interpolant uses only the values of f at thegiven interpolation points.     

A new fourth-order cubic spline method for second-order nonlinear two-point boundary-value problems

Bickley [5] had suggested the use of cubic splines for the solution of general linear two-point boundary-value problems. It is well known since then that this method gives only order h² uniformly convergent approximations. But cubic spline interpolation itself is a fourth-order process. We present a new fourth-order cubic spline method for second-order nonlinear two-point boundary-value problems: y″ = f(x, y, y′), a < x < b, α₀y(a) − α₀y′(a) = A, β₀y(b) + β₁y′(b) = B. We generate the solution at the nodal points by a fourth-order method and then use ‘conditions of continuity’ to obtain smoothed approximations for the second derivatives of the solution needed for the construction of the cubic spline solution. We show that our method provides order h⁴ uniformly convergent approximations over [a, b]. The fourth order of the presented method is demonstrated computationally by two examples.     

Two Interpolatory Cubic Splines

The third order and the uniform cubic spline are defined andshown to have O(h³) and O(h⁴) convergence respectively whenused for interpolation.     

Shape-preserving interpolation by G1 and G2 PH quintic splines

The interpolation of a planar sequence of points p₀, ..., p_Nby shape-preserving G¹ or G² PH quintic splines with specifiedend conditions is considered. The shape-preservation propertyis secured by adjusting ‘tension’ parameters thatarise upon relaxing parametric continuity to geometric continuity.In the G² case, the PH spline construction is based on applyingNewton–Raphson iterations to a global system of equations,commencing with a suitable initialization strategy—thisgeneralizes the construction described previously in NumericalAlgorithms 27, 35–60 (2001). As a simpler and cheaperalternative, a shape-preserving G¹ PH quintic spline schemeis also introduced. Although the order of continuity is lower,this has the advantage of allowing construction through purelylocal equations.     

End Conditions for Interpolatory Quintic Splines

Present address: Department of Mathematics, University of Tabriz, Tabriz, Iran. Accurate end conditions are derived for quintic spline interpolationat equally spaced knots. These conditions are in terms of availablefunction values at the knots and lead to O(h⁶) convergence uniformlyon the interval of interpolation.     

Explicit Error Bounds for Periodic Splines of Odd Order on a Uniform Mesh

The dependence relationships connecting equal interval splinesand their derivatives are analysed to obtain the form of theerror term when the spline is replaced by a general function.The defining equations for periodic splines of odd order ona uniform mesh are then expressed in terms of a positive definitecirculant matrix A and attainable bounds determined for thecondition number of A and for the norm of A^-1. In conjunctionwith the error term associated with the dependence relationships,this enables explicit error bounds to be established for thederivatives at the knots of the spline function. Some subsidiary results in the paper also relate to B-splineson a uniform mesh.     

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.     

Extrapolated Collocation for Two-point Boundary-value Problems using Cubic Splines

A form of collocation is presented, analysed, and illustratedfor the approximate solution of second-order two-point boundary-valueproblems for ordinary differential equations by use of smoothcubic splines. By collocating to a perturbed differential equationwhich is satisfied by an accurate spline interpolant of thetrue solution, we achieve the desired O(h^4-j) global accuracyfor the jth derivative of the solution, together with enhancedaccuracy for the derivatives at certain points; this shouldbe compared with the O(h^2-j) bounds given by standard collocationat the joints.     

A two-dimensional minimum-derivative spline

We consider the construction of a C ^(1,1) interpolation parabolic spline function of two variables on a uniform rectangular grid, i.e., a function continuous in a given region together with its first partial derivatives which on every partial grid rectangle is a polynomial of second degree in x and second degree in y. The spline function is constructed as a minimum-derivative one-dimensional quadratic spline in one of the variables, and the spline coefficients themselves are minimum-derivative quadratic spline functions of the other variable.     

On multivariate Hermite interpolation

We study the problem of Hermite interpolation by polynomials in several variables. A very general definition of Hermite interpolation is adopted which consists of interpolation of consecutive chains of directional derivatives. We discuss the structure and some aspects of poisedness of the Hermite interpolation problem; using the notion of blockwise structure which we introduced in [10], we establish an interpolation formula analogous to that of Newton in one variable and use it to derive an integral remainder formula for a regular Hermite interpolation problem. For Hermite interpolation of degreen of a functionf, the remainder formula is a sum of integrals of certain (n + 1)st directional derivatives off multiplied by simplex spline functions.     

A spline interpolation technique that preserves mass budgets

The usual practice of forcing budget models by linear interpolations of mean data does not produce a forcing whose mean is the data value required. The usual third-order spline is modified into a fourth-order spline, called mc-spline, to cope with this issue.The technique provides a smooth and faithful continuous interpolation of the original data that is well suited for its graphical representations or for the forcing of numerical models.     

The uniform convergence of thin plate spline interpolation in two dimensions

Summary. Let be a function from to that has square integrable second derivatives and let be the thin plate spline interpolant to at the points in . We seek bounds on the error when is in the convex hull of the interpolation points or when is close to at least one of the interpolation points but need not be in the convex hull. We find, for example, that, if is inside a triangle whose vertices are any three of the interpolation points, then is bounded above by a multiple of , where is the length of the longest side of the triangle and where the multiplier is independent of the interpolation points. Further, if is any bounded set in that is not a subset of a single straight line, then we prove that a sequence of thin plate spline interpolants converges to uniformly on . Specifically, we require , where is now the least upper bound on the numbers and where , , is the least Euclidean distance from to an interpolation point. Our method of analysis applies integration by parts and the Cauchy--Schwarz inequality to the scalar product between second derivatives that occurs in the variational calculation of thin plate spline interpolation. Received November 10, 1993 / Revised version received March 1994     

On the convergence of interpolating periodic spline functions of high degree

Let the spline functionS _m of degree 2m?1 and period 1 be the unique solution of the interpolation problem in § 1. An interesting question was posed by Schoenberg [1], p. 125: What happens toS _m if we letm→∞? In this paper, we prove that the spline functionsS _m and their derivatives converge form→∞ to a well determined trigonometric polynomial and its derivatives. Estimates for the rate of convergence are given.     

Error estimates for Hermite interpolation on spheres

In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere S^d−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation.     

Convergence analysis of an interpolation process for the derivatives of a complete spline

The question about the convergence of interpolation processes for the complete splines of odd degree and their derivatives is studied. The study is based on the representation of the spline derivatives in the bases of normalized and non-normalized B-splines. The systems of equations for the coefficients of such representations are obtained. The estimations of derivatives of the error function for the approximation of an interpolated function by the complete spline are established in terms of the norms of inverse matrices of the systems of equations. In particular, the C. de Boor??s hypothesis (1975) on the unconditional convergence of the (n ? 1)-th derivative of a complete (2n ? 1)-degree spline is proved.     

Family of numerical methods based on non-polynomial splines for solution of contact problems

In this paper a new technique based on quartic non-polynomial spline functions connecting spline functions values at mid knots and their corresponding values of the fourth-order derivatives is developed. This approach leads to a family of numerical methods for computing approximations to the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is shown that the present family of methods gives better approximations. Existing second and fourth-order finite-difference and spline functions based methods developed at mid knots become special cases of the new approach. Numerical examples are given to illustrate applicability and efficiency of the new methods.     

A multigrid-type method for thin plate spline interpolation on a circle

We consider the problem of thin plate spline interpolation ton equally spaced points on a circle, where the number of datapoints is sufficiently large for work of O(n³ to be unacceptable.We develop an iterative multigrid-type method, each iterationcomprising ngrid stages, and n being an integer multiple of2^ngrid–1. We let the first grid, V₁ be the full set ofdata points, V say, and each subsequent (coarser) grid, V_k,k=2, 3,...,ngrid, contain exactly half of the data points ofthe preceding (finer) grid, these data points being equallyspaced. At each stage of the iteration, we correct our current approximationto the thin plate spline interpolant by an estimate of the interpolantto the current residuals on V_k, where the correction is constructedfrom Lagrange functions of interpolation on small local subsetsof p data points in V_k. When the coarsest grid is reached, however,then the interpolation problem is solved exactly on its q=n/2^ngrid–1points. The iterative process continues until the maximum residualdoes not exceed a specified tolerance. Each iteration has the effect of premultiplying the vector ofresiduals by an n x n matrix R, and thus convergence will dependupon the spectral radius, (R), of this matrix. We investigatethe dependence of the spectral radius on the values of n, p,and q. In all the cases we have considered, we find (R) <<1, and thus rapid convergence is assured.     

Linear Dependence Relations Connecting Equal Interval Nth Degree Splines and Their Derivatives

Present address: The Polytechnic of the South Bank, Borough Road, London, S.E.1 England. The linear dependence of the values of Nth degree spline andits pth derivatives at N successive equally spaced knots isshown and the constants associated with this linear dependencecalculated. A recurrence relation which enables the constants to be foundfor any N is also given. The results are applied to equal intervalinterpolation.     

OnG 2 continuous cubic spline interpolation

In this paper the interpolation byG ² continuous planar cubic Bézier spline curves is studied. The interpolation is based upon the underlying curve points and the end tangent directions only, and could be viewed as an extension of the cubic spline interpolation to the curve case. Two boundary, and two interior points are interpolated per each spline section. It is shown that under certain conditions the interpolation problem is asymptotically solvable, and for a smooth curvef the optimal approximation order is achieved. The practical experiments demonstrate the interpolation to be very satisfactory. Supported in prat by the Ministry of Science and Technology of Slovenjia, and in part by the NSF and SF of National Educational Committee of China.     

Local quasi-interpolation by cubic C1 splines on type-6 tetrahedral partitions

^** Email: sorokina{at}math.uga.edu^*** Corresponding author. Email: zeilfeld{at}euklid.math.uni-mannheim.de We describe an approximating scheme based on cubic C¹ splineson type-6 tetrahedral partitions using data on volumetric grids.The quasi-interpolating piecewise polynomials are directly determinedby setting their Bernstein–Bézier coefficientsto appropriate combinations of the data values. Hence, eachpolynomial piece of the approximating spline is immediatelyavailable from local portions of the data, without using prescribedderivatives at any point of the domain. The locality of themethod and the uniform boundedness of the associated operatorprovide an error bound, which shows that the approach can beused to approximate and reconstruct trivariate functions. Simultaneously,we show that the derivatives of the quasi-interpolating splinesyield nearly optimal approximation order. Numerical tests withup to 17 x 10⁶ data sites show that the method can be used forefficient approximation.