A parametrization method for the numerical solution of singular differential equations

The paper explains the numerical parametrization method (PM), originally created for optimal control problems, for classical calculus of variation problems that arise in connection with singular implicit (IDEs) and differential-algebraic equations (DAEs) in frame of their regularization. The PM for IDEs is based on representation of the required solution as a spline with moving knots and on minimization of the discrepancy functional with respect to the spline parameters. Such splines are named variational splines. For DAEs only finite entering functions can be represented by splines, and the functional under minimization is the discrepancy of the algebraic subsystem. The first and the second derivatives of the functionals are calculated in two ways – for DAEs with the help of adjoint variables, and for IDE directly. The PM does not use the notion of differentiation index, and it is applicable to any singular equation having a solution.     

The parameterization method in optimal control problems and differential–algebraic equations

The paper is devoted to the explanation of the numerical parameterization method (PM) for optimal control (OC) problems with intermediate phase constraint and to its circumstantiation for classical calculus of variation (CV) problems that arise in connection with singular ODEs or DAEs, especially in cases of their essential degeneracy. The PM is based on a finite parameterization of control functions and on derivation of the problem functional with respect to control parameters. The first and the second derivatives are calculated with the help of adjoint vector and matrix impulses. Results of the solution to one phase constrained OC and two degenerate CV problems, connected with singular DAEs nonreducible to the normal form, are presented.     

Methods for solving singular boundary value problems using splines: a review

This paper surveys and reviews papers of spline solution of singular boundary value problems. Among a number of numerical methods used to solve two-point singular boundary value problems, spline methods provide an efficient tool. Techniques collected in this paper include cubic splines, non-polynomial splines, parametric splines, B-splines and TAGE method.     

Cubic spline for a class of singular two-point boundary value problems

In this paper we have presented a method based on cubic splines for solving a class of singular two-point boundary value problems. The original differential equation is modified at the singular point then the boundary value problem is treated by using cubic spline approximation. The tridiagonal system resulting from the spline approximation is efficiently solved by Thomas algorithm. Some model problems are solved, and the numerical results are compared with exact solution.     

Konstruktion und algebraische Eigenschaften vonM-Spline-Interpolierenden

Summary This paper generates interpolatingM-splines in the sense of Lucas [J. of Approx. Th. 5, 1–14 (1972)] by a simple algebraic construction. The method yieldsM-spline interpolants for every finite family of functionals commuting with the remainder term of a generalized Taylor formula. These assumptions are fulfilled for a large class of spline interpolation problems (e.g. splines generated by certain singular differential operators and splines of several variables) without any further requirements about the geometrical distribution or denseness of the interpolation points. A generalization ofB-splines is used to improve the numerical behaviour of the interpolation process.     

L 1 C 1 polynomial spline approximation algorithms for large data sets

In this article, we address the problem of approximating data points by C ¹-smooth polynomial spline curves or surfaces using L ₁-norm. The use of this norm helps to preserve the data shape and it reduces extraneous oscillations. In our approach, we introduce a new functional which enables to control directly the distance between the data points and the resulting spline solution. The computational complexity of the minimization algorithm is nonlinear. A local minimization method using sliding windows allows to compute approximation splines within a linear complexity. This strategy seems to be more robust than a global method when applied on large data sets. When the data are noisy, we iteratively apply this method to globally smooth the solution while preserving the data shape. This method is applied to image denoising.     

On Spline Collocation for Singular Integral Equations

This paper is devoted to the approximate solution of one-dimensional singular integral equations on a closed curve by spline collocation methods. As the main result we give conditions which are sufficient and in special cases also necessary for the convergence in SOBOLEV norms. The paper is organized as follows. In chapter 1 we indicate some definitions and some facts about projection methods. In chapter 2, we generalize a technique developed in [1] and study the convergence of collocations using splines of odd degree in periodic SOBOLEV spaces. In chapter 3, we apply our method to collocations by splines of even degree and consider the case of systems of equations. And in the last chapter, 4, the results are applied to singular integral equations and compared with known facts about piecewise linear spline collocation for such equations.     

Trivariate near-best blending spline quasi-interpolation operators

A method to define trivariate spline quasi-interpolation operators (QIOs) is developed by blending univariate and bivariate operators whose linear functionals allow oversampling. In this paper, we construct new operators based on univariate B-splines and bivariate box splines, exact on appropriate spaces of polynomials and having small infinity norms. An upper bound of the infinity norm for a general blending trivariate spline QIO is derived from the Bernstein-Bézier coefficients of the fundamental functions associated with the operators involved in the construction. The minimization of the resulting upper bound is then proposed and the existence of a solution is proved. The quadratic and quartic cases are completely worked out and their exact solutions are explicitly calculated.     

Uniform bounds for cardinal Hermite spline operators with double knots

A method is given for computing the uniform norm of the cardinal Hermite spline operator. This is the operator that takes two bounded biinfinite sequences of numbers into the unique bounded spline of degree 2k − 1(k 2) with knots of multiplicity two at the integers and that interpolates the two given sequences for both functional and first derivative values at the integers. The computational schema relies on knowledge of the Bernoulli splines, while the theoretical aspects make use of some properties of zeros of periodic splines.     

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.     

On the use of splines for the numerical solution of nonlinear two-point boundary value problems

Cubic splines on splines and quintic spline interpolations are used to approximate the derivative terms in a highly accurate scheme for the numerical solution of two-point boundary value problems. The storage requirement is essentially the same as for the usual trapezoidal rule but the local accuracy is improved fromO(h ³) to eitherO(h ⁶) orO(h ⁷), whereh is the net size. The use of splines leads to solutions that reflect the smoothness of the slopes of the differential equations.     

High-order discrete-time orthogonal spline collocation methods for singularly perturbed 1D parabolic reaction–diffusion problems

Quasi-optimal error estimates are derived for the continuous-time orthogonal spline collocation (OSC) method and also two discrete-time OSC methods for approximating the solution of 1D parabolic singularly perturbed reaction–diffusion problems. OSC with C¹ splines of degree r ≥ 3 on a Shishkin mesh is employed for the spatial discretization while the Crank–Nicolson method and the BDF2 scheme are considered for the time-stepping. The results of numerical experiments validate the theoretical analysis and also exhibit additional quasi-optimal results, in particular, superconvergence phenomena.     

AnO(h 6) quintic spline collocation method for fourth order two-point boundary value problems

AnO(h ⁶) collocation method based on quintic splines is developed and analyzed for general fourth-order linear two-point boundary value problems. The method determines a quintic spline approximation to the solution by forcing it to satisfy a high order perturbation of the original boundary value problem at the nodal points of the spline. A variation of this method is formulated as a deferred correction method. The error analysis of the new method and its numerical behavior is presented.This research was supported by AFOSR grant 84-0385.     

Univariate cubic L 1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties

In this paper, univariate cubic L ₁ interpolating splines based on the first derivative and on 5-point windows are introduced. Analytical results for minimizing the local spline functional on 5-point windows are presented and, based on these results, an efficient algorithm for calculating the spline coefficients is set up. It is shown that cubic L ₁ splines based on the first derivative and on 5-point windows preserve linearity of the original data and avoid extraneous oscillation. Computational examples, including comparison with first-derivative-based cubic L ₁ splines calculated by a primal affine algorithm and with second-derivative-based cubic L ₁ splines, show the advantages of the first-derivative-based cubic L ₁ splines calculated by the new algorithm.     

A high order projection method for nonlinear two point boundary value problems

Summary Approximations to the solutions of a general class of 2m-th order nonlinear boundary value problems are developed in spaces of polynomial splines of degree 2m+1 by requiring the residual to be orthogonal to a class of polynomial splines of degree 2m–1 over the same mesh. Conditions are given for existence and uniqueness of approximations along with theoretical error rates. In some cases these rates are shown to be of the same order as the best approximation to the solution over the approximating spline spaces. Some computational notes and the results of numerical experiments are also given.     

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.     

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     

Pseudo-polyharmonic vectorial approximation for div-curl and elastic semi-norms

Vector field reconstruction is a problem arising in many scientific applications. In this paper, we study a div-curl approximation of vector fields by pseudo-polyharmonic splines. This leads to the variational smoothing and interpolating spline problems with minimization of an energy involving the curl and the divergence of the vector field. The relationship between the div-curl energy and elastic energy is established. Some examples are given to illustrate the effectiveness of our approach for a vector field reconstruction.     

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.     

Least-squares Spline Regression with Block-diagonal Variance Matrices

A numerical method of solution is presented for the least squaresfitting of experimental data by spline functions in the casewhere the data errors are correlated and for which the variancematrix is specified. The method is general in that it permits(a) splines of any order, (b) the knots of the spline to bearbitrary in number and position, and (c) variance matricesthat are block diagonal in form. Since limiting forms of (c)are diagonal and full variance matrices, the method can handle,as special cases, both conventional spline regression problemsand spline regression problems with general, unstructured variancematrices. An application to gamma spectrometry, in which theblocks of the variance matrix have special structure, is fullytreated.