Multivariate Bernoulli splines and the periodic interpolation problem

Periodic spline interpolation in Euclidian spaceR d is studied using translates of multivariate Bernoulli splines introduced in [25]. The interpolating polynomial spline functions are characterized by a minimal norm property among all interpolants in a Hilbert space of Sobolev type. The results follow from a relation between multivariate Bernoulli splines and the reproducing kernel of this Hilbert space. They apply to scattered data interpolation as well as to interpolation on a uniform grid. For bivariate three-directional Bernoulli splines the approximation order of the interpolants on a refined uniform mesh is computed.     

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.     

Minimal splines and wavelets

This paper is dedicated to the memory of the prominent mathematician S.G. Mikhlin. Here, Mikhlin’s idea of approximation relations is used for construction of wavelet resolution in the case of spline spaces of zero height. These approximation relations allow one to establish the embedding of the spline spaces corresponding to nested grids. Systems of functionals which are biorthogonal to the basic splines are constructed using the relations; then the systems obtained are used for wavelet decomposition. It is established that, for a fixed pair of grids of which one is embedded into the other and for an arbitrary fixed (on the coarse grid) spline space, there exists a continuum of spline spaces (on the fine grid) which contain the aforementioned spline space on the coarse grid. The wavelet decomposition of such embedding is given and the corresponding formulas of decomposition and formulas of reconstruction are deduced. The space of ( , φ)-splines is introduced with three objects: the full chain of vectors, prescribed infinite grid on real axis and the preassigned vector-function φ with m + 1 components (m is called the order of the splines). Under certain assumptions, the splines belong to the class C ^{m ? 1}. The gauge relations between the basic splines on the coarse grid and the basic splines on the fine grid are deduced. A general method for construction of a biorthogonal system of functionals (to basic spline system) is suggested. In this way, a chain of nested spline spaces is obtained, and the wavelet decomposition of the chain is discussed. The spaces and chains of spaces are completely classified in the terms of manifolds. The manifold of spaces considered is identified with the manifold of complete sequences of points of the direct product of an interval on the real axis and the projective space ? ^m ; the manifold of nested spaces is identified with the manifold of nested sequences of points of the direct product mentioned above.     

Integral representation of slowly growing equidistant splines

In this paper we consider polynomial splines S(x) with equidistant nodes which may grow as O (|x|^s). We present an integral representation of such splines with a distribution kernel. This representation is related to the Fourier integral of slowly growing functions. The part of the Fourier exponentials herewith play the so called exponential splines by Schoenberg. The integral representation provides a flexible tool for dealing with the growing equidistant splines. First, it allows us to construct a rich library of splines possessing the property that translations of any such spline form a basis of corresponding spline space. It is shown that any such spline is associated with a dual spline whose translations form a biorthogonal basis. As examples we present solutions of the problems of projection of a growing function onto spline spaces and of spline interpolation of a growing function. We derive formulas for approximate evaluation of splines projecting a function onto the spline space and establish therewith exact estimations of the approximation errors.     

Divergence theorems in path space

We obtain divergence theorems on the solution space of an elliptic stochastic differential equation defined on a smooth compact finite-dimensional manifold M. The resulting divergences are expressed in terms of the Ricci curvature of M with respect to a natural metric on M induced by the stochastic differential equation. The proofs of the main theorems are based on the lifting method of Malliavin together with a fundamental idea of Driver.     

Piecewise monotone interpolation

In reaction to a recent paper by E. Passow in this Journal, it is shown that broken line interpolation as a scheme for piecewise monotone interpolation is hard to improve upon. It is also shown that a family of smooth piecewise polynomial interpolants, introduced by Swartz and Varga and noted by Passow to be piecewise monotone, converges monotonely, for fixed data, to a piecewise constant interpolant as the degree goes to infinity. Finally, piecewise monotone interpolation by splines with simple knots is discussed.     

Quadratic and related exponential splines in shape preserving interpolation

For quadratic and related exponential splines necessary and sufficient conditions are given under which the properties of convexity or monotonicity carry over from the data set to the interpolants. It turns out that for quadratic splines the problems of convex or monotone interpolation may be not solvable. However, when using the more general exponential splines, the shape is preserved if the parameters occuring now are chosen appropriately. Furthermore, since convex or monotone spline interpolants are in general not uniquely determined, a strategy for selecting one of them is proposed.     

Discretized Lavrent’ev regularization for the autoconvolution equation

Lavrent’ev regularization for the autoconvolution equation was considered by Janno J. in Lavrent’ev regularization of ill-posed problems containing nonlinear near-to-monotone operators with application to autoconvolution equation, Inverse Prob. 2000;16:333–348. Here this study is extended by considering discretization of the Lavrent’ev scheme by splines. It is shown how to maintain the known convergence rate by an appropriate choice of spline spaces and a proper choice of the discretization level. For piece-wise constant splines the discretized equation allows for an explicit solver, in contrast to using higher order splines. This is used to design a fast implementation by means of post-smoothing, which provides results, which are indistinguishable from results obtained by direct discretization using cubic splines.     

Spline-wavelet decompositions on manifolds

We construct wavelet decompositions of the spline space on a smooth manifold. For this purpose, framed families of sets of fixed mutliplicity of covering and the corresponding approximation relations are introduced. We compute a calibration matrix and the left inverse matrix which are used to represent the wavelet space. The framing for a family of barycentric stars is studied for a simplicially subdivided manifold homeomorphic to an n-dimensional sphere. Bibliography: 9 titles. __________ Translated from Problemy Matematicheskogo Analiza, No. 36, 2007, pp. 15–22.     

Minimal-norm-derivative spline function in interpolation and approximation

The paper is concerned with applications of quadratic splines with minimal derivative to approximation of functions in approximation and interpolation problems. A smooth spline is constructed on a uniform mesh so as the norm of the spline derivative is minimal; the nodes of the spline and the nodes of interpolations coincide. This approach allows construction of a spline from given values of the function on the mesh without additional assignment of the value of the function derivative at the initial point, because the derivative can be determined from the minimality condition for the norm of the spline derivative in L ₂.     

Natural bicubic spline fractal interpolation

Fractal Interpolation functions provide natural deterministic approximation of complex phenomena. Cardinal cubic splines are developed through moments (i.e. second derivative of the original function at mesh points). Using tensor product, bicubic spline fractal interpolants are constructed that successfully generalize classical natural bicubic splines. An upper bound of the difference between the natural cubic spline blended fractal interpolant and the original function is deduced. In addition, the convergence of natural bicubic fractal interpolation functions towards the original function providing the data is studied.     

On the uniform convergence of parabolic spline interpolation on the class of functions with large gradients in the boundary layer

The problem of parabolic spline interpolation, according to Subbotin, of functions with large gradients in the boundary layer is considered. In the case of a uniform grid it is proved and in the case of the Shishkin mesh it is experimentally shown that with a parabolic spline interpolation of functions with large gradients in the exponential boundary layer, the error can unrestrictedly increase when the small parameter tends to zero and the number of grid nodes is fixed. An approximation process using parabolic splines with defect 1 is proposed; the error estimates are found to be uniform in the small parameter.     

Bivariate spline method for numerical solution of steady state Navier–Stokes equations over polygons in stream function formulation

We use the bivariate spline finite elements to numerically solve the steady state Navier–Stokes equations. The bivariate spline finite element space we use in this article is the space of splines of smoothness r and degree 3r over triangulated quadrangulations. The stream function formulation for the steady state Navier–Stokes equations is employed. Galerkin's method is applied to the resulting nonlinear fourth‐order equation, and Newton's iterative method is then used to solve the resulting nonlinear system. We show the existence and uniqueness of the weak solution in H²(Ω) of the nonlinear fourth‐order problem and give an estimate of how fast the numerical solution converges to the weak solution. The Galerkin method with C¹ cubic splines is implemented in MATLAB. Our numerical experiments show that the method is effective and efficient. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 147–183, 2000     

An efficient algorithm for periodic Hermite spline interpolation with shifted nodes

Generalized Hermite spline interpolation with periodic splines of defect 2 on an equidistant lattice is considered. Then the classic periodic Hermite spline interpolation with shifted interpolation nodes is obtained as a special case.By means of a new generalization of Euler-Frobenius polynomials the symbol of the considered interpolation problem is defined. Using this symbol, a simple representation of the fundamental splines can be given. Furthermore, an efficient algorithm for the computation of the Hermite spline interpolant is obtained, which is mainly based on the fast Fourier transform.     

The boundary element spline collocation for nonuniform meshes on the torus

The spline collocation method for a class of biperiodic strongly elliptic pseudodifferential operators is considered. As trial functions tensor products of odd degree splines are used and the collocation is imposed at the nodal points of the tensor product mesh. It is shown that the collocation problem is uniquely solvable if the maximum mesh length is small enough. Moreover, the approximation is stable and quasioptimal with respect to a norm depending on the order of the operator and the degree of approximating splines. Some convergence results are given for general and quasiuniform meshes. The results cover for example the single layer and the hypersingular operators.     

Shape-Constrained Estimation Using Nonnegative Splines

We consider the problem of nonparametric estimation of unknown smooth functions in the presence of restrictions on the shape of the estimator and on its support using polynomial splines. We provide a general computational framework that treats these estimation problems in a unified manner, without the limitations of the existing methods. Applications of our approach include computing optimal spline estimators for regression, density estimation, and arrival rate estimation problems in the presence of various shape constraints. Our approach can also handle multiple simultaneous shape constraints. The approach is based on a characterization of nonnegative polynomials that leads to semidefinite programming (SDP) and second-order cone programming (SOCP) formulations of the problems. These formulations extend and generalize a number of previous approaches in the literature, including those with piecewise linear and B-spline estimators. We also consider a simpler approach in which nonnegative splines are approximated by splines whose pieces are polynomials with nonnegative coefficients in a nonnegative basis. A condition is presented to test whether a given nonnegative basis gives rise to a spline cone that is dense in the space of nonnegative continuous functions. The optimization models formulated in the article are solvable with minimal running time using off-the-shelf software. We provide numerical illustrations for density estimation and regression problems. These examples show that the proposed approach requires minimal computational time, and that the estimators obtained using our approach often match and frequently outperform kernel methods and spline smoothing without shape constraints. Supplementary materials for this article are provided online.     

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.     

On Spline Approximation for Singular Integral Equations on an Interval

This paper analyses the convergence of spline approximation methods for strongly elliptic singular integral equations on a finite interval. We consider collocation by smooth polynomial splines of odd degree multiplied by a weight function and a Galerkin-Petrov method with spline trial functions of even degree and piecewise constant test functions. We prove the stability of the methods in weighted Sobolev spaces and obtain the optimal orders of convergence in the case of graded meshes.     

High accuracy cubic spline approximation for two dimensional quasi-linear elliptic boundary value problems

We report a new 9 point compact discretization of order two in y- and order four in x-directions, based on cubic spline approximation, for the solution of two dimensional quasi-linear elliptic partial differential equations. We describe the complete derivation procedure of the method in details and also discuss how our discretization is able to handle Poisson’s equation in polar coordinates. The convergence analysis of the proposed cubic spline approximation for the nonlinear elliptic equation is discussed in details and we have shown under appropriate conditions the proposed method converges. Some physical examples and their numerical results are provided to justify the advantages of the proposed method.     

Range restricted interpolation using Gregory's rational cubic splines

The construction of range restricted univariate and bivariate interpolants to gridded data is considered. We apply Gregory's rational cubic C¹ splines as well as related rational quintic C² splines. Assume that the lower and upper obstacles are compatible with the data set. Then the tension parameters occurring in the mentioned spline classes can be always determined in such a way that range restricted interpolation is successful.