Best approximation and numerical methods in solution of differential equations

Let Q(x) bee polynomial of degree q interpolating x^m at the points $\text{x}{}_{\mathrm{<mtext>i</mtext>}}\text{,}\text{i}\text{= 0, 1, /3.,}\text{q}$, where $\text{x}{}_{\mathrm{<mtext>i</mtext>}}$ are zeros of the Tchebysheff polynomial of degree q + 1 on the interval [0, 1]. If q is of order √m, then Q(x) approximates x^m well enough. This result is used to obtain a good approximation to the solution of a system of linear differential equations.     

Solution of integral equations in fractional Sobolev spaces

We consider linear integral equations and Urysohn equations with constant integration limits. Sufficient conditions are given for the solutions of these equations to be in Sobolev spacesW ₂ (0,1), 0 2. Finite-difference schemes are constructed for approximate solution of the original equation by special averaging of the right-hand side kernel. The rate of convergence of the approximate solution to the averaged exact solution is shown to beO(h|ln h|(1/2,)⁺(3/2,)).Translated from Vychislitel'naya i Prikladnaya Matematika, No. 63, pp. 3–19, 1987.     

Nonlinear fractional differential equations of Sobolev type

Sobolev type nonlinear equations with time fractional derivatives are considered. Using the test function method, limiting exponents for nonexistence of solutions are found. Copyright © 2013 John Wiley & Sons, Ltd.     

Stochastic differential equations with coefficients in Sobolev spaces

We consider the Itô stochastic differential equation on Rd. The diffusion coefficients A₁,…,Am are supposed to be in the Sobolev space with p>d, and to have linear growth. For the drift coefficient A₀, we distinguish two cases: (i) A₀ is a continuous vector field whose distributional divergence δ(A₀) with respect to the Gaussian measure γd exists, (ii) A₀ has Sobolev regularity for some p^′>1. Assume for some λ₀>0. In case (i), if the pathwise uniqueness of solutions holds, then the push-forward #(Xt)γd admits a density with respect to γd. In particular, if the coefficients are bounded Lipschitz continuous, then Xt leaves the Lebesgue measure Lebd quasi-invariant. In case (ii), we develop a method used by G. Crippa and C. De Lellis for ODE and implemented by X. Zhang for SDE, to establish existence and uniqueness of stochastic flow of maps.     

The numerical solution of fractional differential equations: Speed versus accuracy

This paper is concerned with the development of efficient algorithms for the approximate solution of fractional differential equations of the form D y(t)=f(t,y(t)), R ⁺–N.()We briefly review standard numerical techniques for the solution of () and we consider how the computational cost may be reduced by taking into account the structure of the calculations to be undertaken. We analyse the fixed memory principle and present an alternative nested mesh variant that gives a good approximation to the true solution at reasonable computational cost. We conclude with some numerical examples.     

Ordinary differential equations,transport theory and Sobolev spaces

Summary We obtain some new existence, uniqueness and stability results for ordinary differential equations with coefficients in Sobolev spaces. These results are deduced from corresponding results on linear transport equations which are analyzed by the method of renormalized solutions.     

Operational solution of fractional differential equations

The main goal of this paper is to solve fractional differential equations by means of an operational calculus. Our calculus is based on a modified shift operator which acts on an abstract space of formal Laurent series. We adopt Weyl’s definition of derivatives of fractional order.     

Uniform B-spline approximation in Sobolev spaces

A new method for approximating functions by uniform B-splines is presented. It is based on the orthogonality relations for uniform B-splines in weighted Sobolev spaces, as introduced in (Reif, 1997). The scheme is local and the approximation order is optimal. Moreover, also constrained approximation problems can be solved efficiently; the size of the linear system to be solved is given by the number of constraints. Applying the method to spline conversion problems specifies new weights for knot removal and degree reduction. This revised version was published online in August 2006 with corrections to the Cover Date.     

On Legendre polynomial approximation with the VIM or HAM for numerical treatment of nonlinear fractional differential equations

The variational iteration method and the homotopy analysis method, as alternative methods, have been widely used to handle linear and nonlinear models. The main property of the methods is their flexibility and ability to solve nonlinear equations accurately and conveniently. This paper deals with the numerical solutions of nonlinear fractional differential equations, where the fractional derivatives are considered in Caputo sense. The main aim is to introduce efficient algorithms of variational iteration and homotopy analysis methods that can be simply used to deal with nonlinear fractional differential equations. In these algorithms, Legendre polynomials are effectively implemented to achieve better approximation for the nonhomogeneous and nonlinear terms that leads to facilitate the computational work. The proposed algorithms are capable of reducing the size of calculations, improving the accuracy and easily overcome the difficulty arising in calculating complicated integrals. Numerical examples are examined to show the efficiency of the algorithms.     

RBFs approximation method for time fractional partial differential equations

In this paper, radial basis functions (RBFs) approximation method is implemented for time fractional advection–diffusion equation on a bounded domain. In this method the first order time derivative is replaced by the Caputo fractional derivative of order α ∈ (0, 1], and spatial derivatives are approximated by the derivative of interpolation in the Kansa method. Stability and convergence of the method is discussed. Several numerical examples are include to demonstrate effectiveness and accuracy of the method.     

Hopf bifurcation in numerical approximation for delay differential equations

In this paper we investigate the qualitative behaviour of numerical approximation to a class delay differential equation. We consider the numerical solution of the delay differential equations undergoing a Hopf bifurcation. We prove the numerical approximation of delay differential equation had a Hopf bifurcation point if the true solution does.     

A numerical algorithm for the solution of nonlinear fractional differential equations via beta‐derivatives

In this paper, the sinc‐collocation method (SCM) is investigated to obtain the solution of the nonlinear fractional order differential equations based on the relatively new defined fractional derivative, beta‐derivative. For this purpose, a theorem is proved for the approximate solution obtained from the SCM. Moreover, convergence analysis of the SCM is presented. To show the efficiency and the simplicity of the proposed method, some examples are solved, and the results are compared with the exact solutions of the considered equations.     

An optimization approach for the numerical approximation of differential equations

An alternative approach for the numerical approximation of ODEs is presented in this article. It is based on a variational framework recently introduced in S. Amat and P. Pedregal [A variational approach to implicit ODEs and differential inclusions, ESAIM: COCV 15 (2009), 149–172] where the solution is sought as the minimizer of an error functional tailored after the ODE in a rather straightforward way. A suitable discretization of this error functional is pursued, and it is performed using Hermite's interpolation and quadrature formulae. Notice that only Hermite's interpolation is necessary when polynomial systems of ODEs are considered (many models in practice use these types of equations). A comparison with implicit Runge–Kutta methods is analysed. With this variational strategy not only some classical collocation methods, but also new schemes that seem to have better numerical behaviour can be recovered. Although the driving idea is very simple, the strategy turns out to be very general and flexible. At the same time, it can be implemented efficiently.     

Multipliers between Sobolev spaces and fractional differentiation

We characterize the pointwise multipliers which maps a Sobolev space to a Sobolev space in the case |s|<r<d/2.     

Higher order numerical methods for solving fractional differential equations

In this paper we introduce higher order numerical methods for solving fractional differential equations. We use two approaches to this problem. The first approach is based on a direct discretisation of the fractional differential operator: we obtain a numerical method for solving a linear fractional differential equation with order 0<α<1. The order of convergence of the numerical method is O(h ^3?α ). Our second approach is based on discretisation of the integral form of the fractional differential equation and we obtain a fractional Adams-type method for a nonlinear fractional differential equation of any order α>0. The order of convergence of the numerical method is O(h ³) for α≥1 and O(h ^1+2α ) for 0<α≤1 for sufficiently smooth solutions. Numerical examples are given to show that the numerical results are consistent with the theoretical results.     

Preserving monotonicity in the numerical solution of Riccati differential equations

Summary. Solutions of symmetric Riccati differential equations (RDEs for short) are in the usual applications positive semidefinite matrices. Moreover, in the class of semidefinite matrices, solutions of different RDEs are also monotone, with respect to properly ordered data. Positivity and monotonicity are essential properties of RDEs. In Dieci and Eirola (1994), we showed that, generally, a direct discretization of the RDE cannot maintain positivity, and be of order greater than one. To get higher order, and to maintain positivity, we are thus forced to look into indirect solution procedures. Here, we consider the problem of how to maintain monotonicity in the numerical solutions of RDEs. Naturally, to obtain order greater than one, we are again forced to look into indirect solution procedures. Still, the restrictions imposed by monotonicity are more stringent that those of positivity, and not all of the successful indirect solution procedures of Dieci and Eirola (1994) maintain monotonicity. We prove that by using symplectic Runge-Kutta (RK) schemes with positive weights (e.g., Gauss schemes) on the underlying Hamiltonian matrix, we eventually maintain monotonicity in the computed solutions of RDEs. Received May 2, 1995