Research Article | Open Access

Volume 2015 |Article ID 650425 | https://doi.org/10.1155/2015/650425

T. A. Biala, S. N. Jator, "Block Backward Differentiation Formulas for Fractional Differential Equations", International Journal of Engineering Mathematics, vol. 2015, Article ID 650425, 14 pages, 2015. https://doi.org/10.1155/2015/650425

# Block Backward Differentiation Formulas for Fractional Differential Equations

Accepted14 Jul 2015
Published29 Sep 2015

#### Abstract

This paper concerns the numerical approximation of Fractional Initial Value Problems (FIVPs). This is achieved by constructing -step continuous BDFs. These continuous schemes are developed via the interpolation and collocation approach and are used to obtain the discrete -step BDF and () additional methods which are applied as numerical integrators in a block-by-block mode for the integration of FIVP. The properties of the methods are established and regions of absolute stability of the methods are plotted in the complex plane. Numerical tests including large systems arising form the semidiscretization of one-dimensional fractional Burger’s equation show that the methods are highly accurate and efficient.

#### 1. Introduction

In what follows, we consider the FIVP of the following form:where is the fractional order and (in the sequel we will simply use ) denotes the Caputo derivative operator which is defined asThe mathematical modeling of several physical phenomena results in fractional differential equations of form (1) and it plays an important role in various branches of science and engineering. Applications of FDEs are found in chemistry, electronics, circuit theory, seismology, signal processing, control theory, and so on. Also, these FDEs serve as a generalization of their corresponding ordinary differential equations (ODEs). For a brief history and introduction to fractional calculus, we refer the reader to .

We have adopted the Caputo’s definition of derivatives of noninteger order (which is a modification of the Riemann-Liouville definition) since it can be coupled with initial conditions having a clear physical meaning. The existence and the uniqueness of the solution of (1) have been given in Diethelm and Ford .

The development of well suited methods for numerically approximating FDEs has received great attention over the past few decades. This is due to the occurence of FDEs in several models. Several methods have been proposed and analyzed for the numerical approximation of this important class of problems (see Lubich , Garrappa , Galeone and Garrappa , and the references therein). These authors have independently developed Fractional Linear Multistep Methods (FLMMs) using convolution quadratures. Lubich  proposed formulas of the following form:where and are the convolution and starting quadrature weights, respectively, and are independent of the stepsize .

One major difficulty in the FLMMs (3) is in evaluating the convolution weights . Most of the methods rely on the J.C.P Miller formula for the computation of these weights. In order to avoid this major drawback, we give a different approach in the construction of the FLMMs. This approach is based on interpolation and collocation as was discussed by Onumanyi et al. .

The main aim of this paper is to present and investigate a class of fractional BDF methods which generalize the BDF methods for ODEs. The fractional BDF methods are developed using the interpolation and collocation approach and the regions of absolute stability of the methods are plotted via the boundary locus method.

The paper is organized as follows: in Section 2, we discuss the development of the fractional BDF methods. Section 3 details the convergence of the methods while, in Section 4, we give the stability properties and implementation of the methods. In Section 5, we give five numerical examples to elucidate our theoretical results. Finally, we give some concluding remarks in Section 6.

#### 2. Fractional BDFs

We will construct a -step Continuous Fractional BDF (CFBDF) which will be used to obtain the discrete fractional BDF (FBDF). The CFBDF has the following general form:where and are continuous coefficients. We assume that is the numerical approximation to the analytical solution and is an approximation to . The CFBDF is constructed from its equivalent form by requiring that the exact solution is locally approximated by function (4) on the interval . Next, we discuss the construction of the CFBDF in the following theorem.

Theorem 1. Let (4) satisfy the following conditions: Then continuous representation (4) is equivalent to where we define matrix as is obtained by replacing the th column of by where denotes the transpose, , , are basis functions, and is a vector given by

Proof. We require that method (4) be defined by the assumed polynomial basis functions: where and are coefficients to be determined.
Substituting (9) into (4), we have which may be written as and expressed as where By imposing condition (5) on (12), we obtain a system of equations, which can be expressed as where is a vector of undetermined coefficients. Using Crammer’s rule, the elements of can be obtained and are given by where is obtained by replacing the th column of by . We rewrite (12) using the newly found elements of as

Remark 2. Continuous scheme (4) which is equivalent to (6) is evaluated at to obtain the -step FBDF of the following form:Also, we emphasize that continuous scheme (6) is used to obtain and evaluated at ,  , to obtain which, together with (16), forms the Block FBDF (BFBDF) which may be written in the following form: where , , and are the coefficients of the formulas in (16) and (17), and is a vector of initial conditions.

Remark 3. We note that it is possible to construct method (6) using other bases such exponential and trigonometric functions. However, (6) is constructed using polynomial basis functions, since methods produced via polynomial basis functions are easier to analyze. In fact, using other bases for the construction of (6) has the disadvantage of introducing additional parameters which makes the analysis of the methods produced more cumbersome. Moreover, the polynomial basis functions are appropriate for the construction of this class of methods since other bases can be written as polynomials in via the Taylor series expansion.

#### 3. Convergence of Methods

In this section, we will discuss the convergence of the methods in the following theorem.

Theorem 4. Let be Lipschitz continuous with respect to y in a region defined by and , where and are finite. Let (16) and (17) be constructed in such a way that ; then (18) is said to be convergent if, for all initial value problems (1), we have that for all and where constant does not depend on and is the order of the method and is sufficiently small.

Proof. The exact form of the system formed by (16) and (17) is given by where is the truncation error vector of the formula in (18), , and .
The approximate form of the system is given by where is the approximate solution of vector .
Subtracting (20) from (21), we obtain the following error system: where . Let be the Lipschitz constant of ; then Let , so that exists since it is a monotone matrix (see ).

Definition 5. BFAMM (18) is said to be (a)stable if and only if, for any , there exists such that the solution of (1) satisfies for ,(b)asymptotically stable if and only if, for any , the solution of (1) satisfies as .

#### 4. Stability Properties of the Methods

To study the stability properties of BFBDF (18), we consider the following linear test problem: whose exact solution can be expressed in terms of the Mittag-Leffler function , as .

We rewrite (18) in the following form: where , , and . Applying (26) to the linear test equation, we have the following linear recurrence relation: where where is the amplification matrix which determines the stability of the method.

We are interested in investigating the values of for which the numerical solution of (1) given by (18) asymptotically vanishes as the true solution. We give below the following definitions.

Definition 6. Stability domain of BFBDF (18) is the set of all such that linear recurrence (18) is asymptotically stable.

Definition 7. The stability domain of BFBDF (18) is given by the following set: where is the spectral radius of .

Figures 1, 2, 3, and 4 show the plot of the stability domain of BFBDF (18) for some for to

Remark 8. The 1-step BFBDF is -stable for all values of while the 2-step and 3-step BFBDF are -stable for values of . Also, the -step BFBDF is -stable for .

##### 4.1. Implementation

Conventionally, FBDF (16) requires initial conditions which are usually provided using a one-step method (like the Runge-Kutta method). However, in this paper, we construct additional methods from continuous scheme (15) which are implemented together with FBDF (16) to obtain approximate solutions to the exact solution of (1) without requiring starting values and predictors. For instance, if and , then are simultaneously obtained over the interval as is known from the IVP. Similarly, if and , then are simultaneously obtained over the interval and is known from the previous block and so on, until we reach the final subinterval .

#### 5. Numerical Examples

We validate our theoretical results from the previous sections by considering the following examples, which were solved using the BFBDF using a written code in Mathematica. The maximum errors are obtained for different step sizes in the interval of integration. We have solved two scalar examples, one system, one linear, and one nonlinear heat-type fractional differential equation.

Example 1. We consider the following problem given in :

Tables 1, 2, and 3 show the numerical results for Example 1 using different values of . It is evident from the table that the BFBDF performs favorably well with smaller number of steps.

Example 2. We also consider the following FIVP with variable coefficients:

This example was chosen to show the performance of the BFBDF on FIVP with variable coefficients. Tables 4, 5, and 6 show the numerical results for Example 2 using different values of . It is evident from the table that the BFBDF performs favorably well with smaller number of steps.

Example 3. We also consider the system of FIVP given in :

This example was chosen to show that the BFBDF performs well on a system as demonstrated for . We note that for the solutions produced by the BFBDF are in agreement with the expected behavior of the exact solution. Details of the results are displayed in Table 7 and Figures 5 and 6.

Example 4. We also consider the following one-dimensional fractional heat-like problem given in :subject to the initial/boundary conditions , , , and . The exact solution

In order to solve this PDE using the BFBDF, we carry out the semidiscretization of the spatial variable using the second-order finite difference method to obtain the following first-order system in the second variable : where , , , , , , and , which can be written in the following form:subject to the boundary conditions , where and A is matrix arising from the semidiscretized system and is a vector of constants.

This example was chosen to show that the BFBDF performs well on a one-dimensional fractional heat-like problem with variable coefficients as demonstrated for . We note that for the solutions produced by the BFBDF are in agreement with the expected behavior of the exact solution. Details of the results are displayed in Figures 7 and 8.

Example 5. We consider the following fractional Burger’s equation given in :subject to the initial/boundary conditions , , , and . The exact solution ,

In order to solve this PDE using the BFBDF, we carry out the semidiscretization of the spatial variable using the second-order finite difference method to obtain the following first-order system in the second variable : where , , , , , , and , which can be written in the following form:subject to the boundary conditions , where and is matrix arising from the semidiscretized system and is a vector of constants.

This example was chosen to show that the BFBDF performs well on the Burger’s equation as demonstrated for . We note that for the solutions produced by the BFBDF are in agreement with the expected behavior of the exact solution. Details of the results are displayed in Figures 9 and 10.

##### 5.1. Block versus Predictor-Corrector Implementations

In order to demonstrate the superiority of the block implementation of the BFBDF over its predictor-corrector (PC) implementation, we have solved Example 1 for and the results are displayed in Table 8. We constructed Fractional Explicit Adams Methods and used them as predictors for the FBDF. In Table 8, we observe that as the step length decreases the PC mode gives inaccurate approximations, while the BFBDF still retains its high accuracy. With these observations, we conclude that the BFBDF can be used as a general purpose method for the integration of fractional differential equations.

 Block PC Block PC Block PC Block PC 10 20