A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback’s quasi-interpolation scheme.     

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.     

A characterization of multivariate quasi-interpolation formulas and its applications

Summary Let be a compactly supported function on ^s andS () the linear space withgenerator ; that is,S () is the linear span of the multiinteger translates of . It is well known that corresponding to a generator there are infinitely many quasi-interpolation formulas. A characterization of these formulas is presented which allows for their direct calculation in a variety of forms suitable to particular applications, and in addition, provides a clear formulation of the difficult problem of minimally supported quasi-interpolants. We introduce a generalization of interpolation called -interpolation and a notion of higher order quasi-interpolation called -approximation. A characterization of -approximants similar to that of quasi-interpolants is obtained with similar applications. Among these applications are estimating least-squares approximants without matrix inversion, surface fitting to incomplete or semi-scattered discrete data, and constructing generators with one-point quasi-interpolation formulas. It will be seen that the exact values of the generator at the multi-integers ^s facilitates the above study. An algorithm to yield this information for box splines is discussed.Supported by the National Science Foundation and the U.S. Army Research Office     

Constrained variational refinement

A non-uniform, variational refinement scheme is presented for computing piecewise linear curves that minimize a certain discrete energy functional subject to convex constraints on the error from interpolation. Optimality conditions are derived for both the fixed and free-knot problems. These conditions are expressed in terms of jumps in certain (discrete) derivatives. A computational algorithm is given that applies to constraints whose boundaries are either piecewise linear or spherical. The results are applied to closed periodic curves, open curves with various boundary conditions, and (approximate) Hermite interpolation.     

On the asymptotic stability of discontinuous systems analysed via the averaging method

The averaging method is one of the most powerful methods used to analyse differential equations appearing in the study of nonlinear problems. The idea behind the averaging method is to replace the original equation by an averaged equation with simple structure and close solutions. A large number of practical problems lead to differential equations with discontinuous right-hand sides. In a rigorous theory of such systems, developed by Filippov, solutions of a differential equation with discontinuous right-hand side are regarded as being solutions to a special differential inclusion with upper semi-continuous right-hand side. The averaging method was studied for such inclusions by many authors using different and rather restrictive conditions on the regularity of the averaged inclusion. In this paper we prove natural extensions of Bogolyubov’s first theorem and the Samoilenko-Stanzhitskii theorem to differential inclusions with an upper semi-continuous right-hand side. We prove that the solution set of the original differential inclusion is contained in a neighbourhood of the solution set of the averaged one. The extension of Bogolyubov’s theorem concerns finite time intervals, while the extension of the Samoilenko-Stanzhitskii theorem deals with solutions defined on the infinite interval. The averaged inclusion is defined as a special upper limit and no additional condition on its regularity is required.     

The BS class of Hermite spline quasi-interpolants on nonuniform knot distributions

The BS Hermite spline quasi-interpolation scheme is presented. It is related to the continuous extension of the BS linear multistep methods, a class of Boundary Value Methods for the solution of Ordinary Differential Equations. In the ODE context, using the numerical solution and the associated numerical derivative produced by the BS methods, it is possible to compute, with a local approach, a suitable spline with knots at the mesh points collocating the differential equation at the knots and having the same convergence order as the numerical solution. Starting from this spline, here we derive a new quasi-interpolation scheme having the function and the derivative values at the knots as input data. When the knot distribution is uniform or the degree is low, explicit formulas can be given for the coefficients of the new quasi-interpolant in the B-spline basis. In the general case these coefficients are obtained as solution of suitable local linear systems of size 2d×2d, where d is the degree of the spline. The approximation order of the presented scheme is optimal and the numerical results prove that its performances can be very good, in particular when suitable knot distributions are used.     

Weighted estimate for the convergence rate of a projection difference scheme for a parabolic equation and its application to the approximation of the initial-data control problem

A new technique is proposed for analyzing the convergence of a projection difference scheme as applied to the initial value problem for a linear parabolic operator-differential equation. The technique is based on discrete analogues of weighted estimates reflecting the smoothing property of solutions to the differential problem for t > 0. Under certain conditions on the right-hand side, a new convergence rate estimate of order O($ \sqrt \tau $ \sqrt \tau + h) is obtained in a weighted energy norm without making any a priori assumptions on the additional smoothness of weak solutions. The technique leads to a natural projection difference approximation of the problem of controlling nonsmooth initial data. The convergence rate estimate obtained for the approximating control problems is of the same order O($ \sqrt \tau $ \sqrt \tau + h) as for the projection difference scheme.     

Convergence of the numerical solution of the initial-boundary value problem for a heat equation with a corner singularity in derivatives of the solution

An estimate O(τ + h ²)ln(j + 1) of the convergence rate for the solution of a four-point implicit difference scheme used for approximations on a uniform grid of a one-dimensional heat equation is obtained, with the provision that the boundary and initial data are subject at corner points only to the continuity condition, with no other compatibility conditions being satisfied. A discrete Green’s function is used to obtain an a priori estimate of the grid solution in terms of the appropriate negative norm of the right-hand side.     

Jumps of the fundamental solution matrix in discontinuous systems and applications

This paper deals with differential equations with discontinuous right-hand side. The concept of a solution for a discontinuous system is defined on the basis of differential inclusions using Filippov’s method. We study in particular the behaviour of solutions crossing a discontinuity surface transversally. A formula characterizing jumps of the fundamental solution matrix is derived. As an application of it, the concept of Poincaré mapping is defined for such systems.     

Approximation inL 2 Sobolev spaces on the 2-sphere by quasi-interpolation

In this article we consider a simple method of radial quasi-interpolation by polynomials on the unit sphere in ℝ³, and present rates of covergence for this method in Sobolev spaces of square integrable functions. We write the discrete Fourier series as a quasi-interpolant and hence obtain convergence rates, in the aforementioned Sobolev spaces, for the discrete Fourier projection. We also discuss some typical practical examples used in the context of spherical wavelets.     

A new forecasting method of discrete dynamic system

Usually, a linear differential equation is used to represent continuous dynamic systems, but a linear difference equation is used to represent discrete dynamic systems. AGO is one of the most important characteristics of grey theory, and its main purpose is to reduce the random of data. A linear differential equation, instead of a linear difference equation, is used to replace the grey differential equation to analyze discrete systems in this paper. The k-order derivatives of 1-AGO data are calculated after cubic spline interpolation of them, and the model parameters are estimated by means of the deterministic convergence scheme. ARIMA models are used to analyze the leading indicator in advance, and Fourier series with suitably chosen values of parameters is used for fitting the leading indicator. The model presented in this paper is called Grey Dynamic Model GDM(1,1,1).     

Optimal control of linear parabolic equation:the constrained right-hand side as control function

The quadratic cost control problem for a linear parabolic equation controlled by the constrained right-hand side of the equation is considered. Finite-dimensional approximation scheme for finding approximate solutions is proposed and its convergence rate is estimated. The set of optimal controls and its continuity properties with respect to the problem's data are studied. The convergence of the approximation scheme in the case when the control consists of both the constrained initial condition and the constrained right-hand side of the equation is proved.     

Convergence of subdivision schemes in L p spaces

Abstract. In this paper it is proved that Lp solutions of a refinement equation exist if and only ifthe corresponding subdivision scheme with suitable initial function converges in Lp without anyassumption on the stability of the solutions of the refinement equation. A characterization forconvergence of subdivision scheme is also given in terms of the refinement mask. Thus a com-plete answer to the relation between the existence of Lp solutions of the refinement equation andthe convergence of the corresponding subdivision schemes is given.     

A class of functional equation and fractal interpolation functions

A new class of functional equation in C0(I) is investigated. It is proved that some class of FIF satisfies the functional equation. Another functional equation is constructed. Theirsolutions can approximate FIF arbitrarily. And a new approximate estimate between FIF andinterpolated function is given.     

Singular Dirichlet second-order BVPs with impulses

The paper deals with the existence of solutions to singular second-order differential equations with impulse effects and with the Dirichlet boundary conditions. The right-hand side of the differential equation can be singular in its phase variable.     

Approximation of analytic functions by Legendre functions

We will solve the inhomogeneous Legendre’s differential equation and apply this result to estimate the error bound occurring when an analytic function is approximated by an appropriate Legendre function.     

Fundamental solution of displacement equations for a transversely isotropic elastic medium

A fourth-order linear elliptic partial differential equation describing the displacements of a transversely isotropic linear elastic medium is considered. Its symmetries and the symmetries of an inhomogeneous equation with a delta function on the right-hand side are found. The latter symmetries are used to construct an invariant fundamental solution of the original equation in terms of elementary functions.     

On an iterative method for a class of integral equations of the first kind

In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part of the paper presents a motivation for the iterative method and discusses its convergence. In particular, it is shown that there is a connection between the iterative scheme and a certain concave functional associated with integral equations of this type. This functional can be interpreted as a generalization of the log-likelihood function of a model from emission tomography. The second part of the paper investigates the convergence properties of the discrete analogue of the iterative method associated with the discretized equation. Sufficient conditions for local convergence are given; and it is shown that, in general, convergence is very slow. Two numerical examples are presented.     

Multidomain Legendre-Galerkin Least-Squares Method for Linear Differential Equations with Variable Coefficients

The multidomain Legendre-Galerkin least-squares method is developed for solving linear differential problems with variable coefficients. By introducing a flux, the original differential equation is rewritten into an equivalent first-order system, and the Legendre Galerkin is applied to the discrete form of the corresponding least squares function. The proposed scheme is based on the Legendre-Galerkin method, and the Legendre/Chebyshev-Gauss-Lobatto collocation method is used to deal with the variable coefficients and the right hand side terms. The coercivity and continuity of the method are proved and the optimal error estimate in $H^1$-norm is obtained. Numerical examples are given to validate the efficiency and spectral accuracy of our scheme. Our scheme is also applied to the numerical solutions of the parabolic problems with discontinuous coefficients and the two-dimensional elliptic problems with piecewise constant coefficients, respectively.     

Boundary value problems with operator right-hand side

For a second-order boundary value problem with operator right-hand side and with functional boundary conditions, we prove solvability theorems with mixed and Dirichlet boundary conditions assuming the existence of a lower and an upper function. These theorems are analogs of theorems for the corresponding boundary value problems for an ordinary second-order differential equation with right-hand side satisfying the Carathéodory conditions.