Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.     

Numerical methods for multi-term fractional (arbitrary) orders differential equations

Our main concern here is to give a numerical scheme to solve a nonlinear multi-term fractional (arbitrary) orders differential equation.     

Boundary value problems for multi-term fractional differential equations

Multi-term fractional diffusion-wave equation along with the homogeneous/non-homogeneous boundary conditions has been solved using the method of separation of variables. It is observed that, unlike in the one term case, solution of multi-term fractional diffusion-wave equation is not necessarily non-negative, and hence does not represent anomalous diffusion of any kind.     

A new semi-analytical collocation method for solving multi-term fractional partial differential equations with time variable coefficients

The aim of this paper is to present a new numerical method for solving a wide class of fractional partial differential equations (FPDEs) such as wave-diffusion equations, modified anomalous fractional sub-diffusion equations, time-fractional telegraph equations. The proposed method is based on the Fourier series expansion along the spatial coordinate which transforms the original equation into a sequence of multi-term fractional ordinary differential equations (ODEs). These fractional equations are solved by the use of a new efficient numerical technique – the backward substitution method. The numerical examples confirm the high accuracy and efficiency of the proposed numerical scheme in solving FPDEs with variable in time coefficients.     

Piecewise polynomial collocation for linear boundary value problems of fractional differential equations

We consider a class of boundary value problems for linear multi-term fractional differential equations which involve Caputo-type fractional derivatives. Using an integral equation reformulation of the boundary value problem, some regularity properties of the exact solution are derived. Based on these properties, the numerical solution of boundary value problems by piecewise polynomial collocation methods is discussed. In particular, we study the attainable order of convergence of proposed algorithms and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by two numerical examples.     

Moving collocation methods for time fractional differential equations and simulation of blowup

A moving collocation method is proposed and implemented to solve time fractional differential equations. The method is derived by writing the fractional differential equation into a form of time difference equation. The method is stable and has a third-order convergence in space and first-order convergence in time for either linear or nonlinear equations. In addition, the method is used to simulate the blowup in the nonlinear equations.     

On the convergence of spline collocation methods for solving fractional differential equations

In the first part of this paper we study the regularity properties of solutions of initial value problems of linear multi-term fractional differential equations. We then use these results in the convergence analysis of a polynomial spline collocation method for solving such problems numerically. Using an integral equation reformulation and special non-uniform grids, global convergence estimates are derived. From these estimates it follows that the method has a rapid convergence if we use suitable nonuniform grids and the nodes of the composite Gaussian quadrature formulas as collocation points. Theoretical results are verified by some numerical examples.     

Spectral collocation method for linear fractional integro-differential equations

In this paper, we propose and analyze a spectral Jacobi-collocation method for the numerical solution of general linear fractional integro-differential equations. The fractional derivatives are described in the Caputo sense. First, we use some function and variable transformations to change the equation into a Volterra integral equation defined on the standard interval [-1,1]$[-1\text{,}1]$. Then the Jacobi–Gauss points are used as collocation nodes and the Jacobi–Gauss quadrature formula is used to approximate the integral equation. Later, the convergence order of the proposed method is investigated in the infinity norm. Finally, some numerical results are given to demonstrate the effectiveness of the proposed method.     

Existence and uniqueness for a class of multi-term fractional differential equations

In this paper, we consider the initial value problem for the nonlinear fractional differential equations

$$\begin{aligned} \left\{ \begin{array}{l@{\quad }l} D^\alpha u(t)=f(t,u(t),D^{\beta _1}u(t),\ldots ,D^{\beta _N}u(t)), \quad &{}t\in (0,1],\\ D^{\alpha -k}u(0)=0, \quad &{}k=1,2,\ldots ,n, \end{array} \right. \end{aligned}$$

where \(\alpha >\beta _1>\beta _2>\cdots \beta _N>0\), \(n=[\alpha ]+1\) for \(\alpha \notin \mathbb {N}\) and \(\alpha =n\) for \(\alpha \in \mathbb {N}\), \(\beta _j<1\) for any \(j\in \{1,2,\ldots ,N\}\), D is the standard Riemann–Liouville derivative and \(f:[0,1]\times \mathbb {R}^{N+1}\rightarrow \mathbb {R}\) is a given function. By means of Schauder fixed point theorem and Banach contraction principle, an existence result and a unique result for the solution are obtained,respectively. As an application, some examples are presented to illustrate the main results.

     

Pseudospectral collocation methods for fourth-order differential equations

A multi-domain pseudospectral collocation scheme for the approximationof linear fourth-order differential equations in one and twodimensions is presented. A complete analysis of the scheme isprovided and error estimates are proved for the one-dimensionalproblem. An efficient preconditioner based on a low-order finite-differenceapproximation to the same differential operator is proposed.The extension of the method to the biharmonic equation in twodimensions is discussed and results are presented for a problemdefined in a non-rectangular domain. Present address: Department of Mathematics, Tarbiat ModarresUniversity, Tehran, iran     

Systems-based decomposition schemes for the approximate solution of multi-term fractional differential equations

We give a comparison of the efficiency of three alternative decomposition schemes for the approximate solution of multi-term fractional differential equations using the Caputo form of the fractional derivative. The schemes we compare are based on conversion of the original problem into a system of equations. We review alternative approaches and consider how the most appropriate numerical scheme may be chosen to solve a particular equation.     

Two-step almost collocation methods for ordinary differential equations

A new class of two-step Runge-Kutta methods for the numerical solution of ordinary differential equations is proposed. These methods are obtained using the collocation approach by relaxing some of the collocation conditions to obtain methods with desirable stability properties. Local error estimation for these methods is also discussed.     

Numerical comparison of methods for solving linear differential equations of fractional order

In this article, we implement relatively new analytical techniques, the variational iteration method and the Adomian decomposition method, for solving linear differential equations of fractional order. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of fractional differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. This paper will present a numerical comparison between the two methods and a conventional method such as the fractional difference method for solving linear differential equations of fractional order. The numerical results demonstrates that the new methods are quite accurate and readily implemented.     

Spline collocation methods for nonlinear Volterra integral equations with unknown delay

In this paper we introduce and study polynomial spline collocation methods for systems of Volterra integral equations with unknown lower integral limit arising in mathematical economics. Their discretization leads to implicit Runge-Kutta-type methods. The global convergence and local superconvergence properties of these methods are proved, and the theory is illustrated by a numerical example arising in the application of such equations in certain mathematical models of liquidation.     

A new formula for fractional integrals of Chebyshev polynomials: Application for solving multi-term fractional differential equations

A new explicit formula for the integrals of shifted Chebyshev polynomials of any degree for any fractional-order in terms of shifted Chebyshev polynomials themselves is derived. A fast and accurate algorithm is developed for the solution of linear multi-order fractional differential equations (FDEs) by considering their integrated forms. The shifted Chebyshev spectral tau (SCT) method based on the integrals of shifted Chebyshev polynomials is applied to construct the numerical solution for such problems. The method is then tested on examples. It is shown that the SCT yields better results.     

Numerical solution of multi-order fractional differential equations with multiple delays via spectral collocation methods

This paper discusses a general framework for the numerical solution of multi-order fractional delay differential equations (FDDEs) in noncanonical forms with irrational/rational multiple delays by the use of a spectral collocation method. In contrast to the current numerical methods for solving fractional differential equations, the proposed framework can solve multi-order FDDEs in a noncanonical form with incommensurate orders. The framework can also solve multi-order FDDEs with irrational multiple delays. Next, the framework is enhanced by the fractional Chebyshev collocation method in which a Chebyshev operation matrix is constructed for the fractional differentiation. Spectral convergence and small computational time are two other advantages of the proposed framework enhanced by the fractional Chebyshev collocation method. In addition, the convergence, error estimates, and numerical stability of the proposed framework for solving FDDEs are studied. The advantages and computational implications of the proposed framework are discussed and verified in several numerical examples.     

Quadratic spline collocation for one-dimensional linear parabolic partial differential equations

New methods for solving general linear parabolic partial differential equations (PDEs) in one space dimension are developed. The methods combine quadratic-spline collocation for the space discretization and classical finite differences, such as Crank-Nicolson, for the time discretization. The main computational requirements of the most efficient method are the solution of one tridiagonal linear system at each time step, while the resulting errors at the gridpoints and midpoints of the space partition are fourth order. The stability and convergence properties of some of the new methods are analyzed for a model problem. Numerical results demonstrate the stability and accuracy of the methods. Adaptive mesh techniques are introduced in the space dimension, and the resulting method is applied to the American put option pricing problem, giving very competitive results.     

Quadratic spline collocation methods for elliptic partial differential equations

We consider Quadratic Spline Collocation (QSC) methods for linear second order elliptic Partial Differential Equations (PDEs). The standard formulation of these methods leads to non-optimal approximations. In order to derive optimal QSC approximations, high order perturbations of the PDE problem are generated. These perturbations can be applied either to the PDE problem operators or to the right sides, thus leading to two different formulations of optimal QSC methods. The convergence properties of the QSC methods are studied. OptimalO(h ^3–j ) global error estimates for thejth partial derivative are obtained for a certain class of problems. Moreover,O(h ^4–j ) error bounds for thejth partial derivative are obtained at certain sets of points. Results from numerical experiments verify the theoretical behaviour of the QSC methods. Performance results also show that the QSC methods are very effective from the computational point of view. They have been implemented efficiently on parallel machines.This research was supported in part by David Ross Foundation (U.S.A) and NSERC (Natural Sciences and Engineering Research Council of Canada).     

Adaptive methods for piecewise polynomial collocation for ordinary differential equations

Various adaptive methods for the solution of ordinary differential boundary value problems using piecewise polynomial collocation are considered. Five different criteria are compared using both interval subdivision and mesh redistribution. The methods are all based on choosing sub-intervals so that the criterion values have (approximately) equal values in each sub-interval. In addition to the main comparison it is shown by example that at least when accuracy is low then equidistribution may not give a unique solution. The main results that using interval size times maximum residual as criterion gives very much better results than using maximum residual itself. It is also shown that a criterion based on a global error estimate while giving very good results in some cases, is unsatisfactory in other cases. The other criteria considered are that given by De Boor and the last Chebyshev series coefficient. AMS subject classification (2000)  65L10, 65L50, 65L60