The Scientific World Journal

Volume 2014, Article ID 402373, 21 pages

http://dx.doi.org/10.1155/2014/402373

## Determination of Coefficients of High-Order Schemes for Riemann-Liouville Derivative

Department of Mathematics, Shanghai University, Shanghai 200444, China

Received 10 December 2013; Accepted 4 February 2014; Published 15 April 2014

Academic Editors: B. Carpentieri and C. Silva

Copyright © 2014 Rifang Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Although there have existed some numerical algorithms for the fractional differential equations, developing high-order methods (i.e., with convergence order greater than or equal to 2) is just the beginning. Lubich has ever proposed the high-order schemes when he studied the fractional linear multistep methods, where he constructed the th order schemes for the th order Riemann-Liouville integral and th order Riemann-Liouville derivative. In this paper, we study such a problem and develop recursion formulas to compute these coefficients in the higher-order schemes. The coefficients of higher-order schemes are also obtained. We first find that these coefficients are oscillatory, which is similar to Runge’s phenomenon. So, they are not suitable for numerical calculations. Finally, several numerical examples are implemented to testify the efficiency of the numerical schemes for .

#### 1. Introduction

Loosely speaking, fractional calculus is often regarded as the generalization of classical calculus. From the viewpoint of rigorous mathematics, this is not the case; see [1]. Now, fractional calculus has been successfully applied in the fields of chemistry, physics, finance, signal processing, bioengineering, and control. For details, see [2–11] and references cited therein.

Although there are more than six kinds of fractional derivatives, the commonly used derivatives are Riemann-Liouville, Grünwald-Letnikov, and Caputo ones. In this paper, we focus on Riemann-Liouville derivative. Under suitable conditions, the Riemann-Liouville derivative can be discretized by the discrete form of the Grünwald-Letnikov one.

Some numerical approximate formulas for fractional calculus have been proposed [4, 12–24]. It is worth mentioning that the fractional linear multistep (also high-order) methods for the Riemann-Liouville integrals and derivatives were firstly proposed in [16]. The high-order numerical methods for Caputo derivatives were firstly constructed in [15]. The high-order algorithms for Riesz derivative was firstly considered by Ding et al. [25].

In the following, we give some basic definitions, notations, and properties of the fractional calculus [1, 3, 7, 26].

*Definition 1. *Let be defined on the interval and . Then, the left Riemann-Liouville integral of order is defined as
where is Euler’s gamma function.

*Definition 2. *Let be defined on the interval and and let be the smallest integer greater than . Then, the left Riemann-Liouville derivative of order is defined by

*Definition 3. *Let be defined on the interval and and let be the smallest integer greater than . Then, the left Caputo derivative of order is defined as follows:

*Definition 4. *Let be defined on the interval and . Then, the left Grünwald-Letnikov derivative of order is defined as

Lemma 5. *Suppose that is differentiable in the senses of both Caputo and Riemann-Liouville. Then,
**
where .*

Lemma 6. *Let ; then the finite Grünwald-Letnikov derivative
**
yields a first-order approximation for the Riemann-Liouville derivative if ; that is,
**
But when , then one has
*

*The present paper is organized as follows. We divide Section 2 into three subsections. In Section 2.1, we introduce the recursion formulas of coefficients of orders 1 and 2, which are usually used, and some properties are given. In Section 2.2, coefficients of orders from 3 to 6 are presented for reference. And coefficients of orders from 7 to 10 are displayed in Section 2.3 which are oscillatory. Such a phenomenon is similar to Runge’s phenomenon. So, the high-order (more than 6th-order) schemes seem not to be suitable for numerical calculations, which is the same as the case of ordinary differential equation. In Section 3, some numerical experiments are carried out to support the computational schemes. Section 4 concludes this paper.*

*2. The Determination of the Coefficients*

*Firstly, we divide the given interval into
and , in which , .*

*In most situations, we naturally use the following formula to approximate the Riemann-Liouville derivative:
where
are the binomial coefficients. And they have the following recurrence relationships:
*

*Obviously, are just the first coefficients of Taylor series of the expansion of the following function:
*

*We can see that formula (10) has only the first-order accuracy if . Therefore, to seek high accurate numerical methods for the fractional derivatives is of great importance. In [16], Lubich firstly proposed numerical schemes of orders 2, 3, 4, 5, and 6 Riemann-Liouvile derivative, named fractional linear multistep formulas. Here, it must be mentioned that the fractional linear multistep method is different from the usual linear multistep method. The former is of varied steps. That is to say, the value of the th step relies on the preceding step values , which means that the number of multisteps is increasing, while the latter is of fixed number of multisteps. Under the homogeneous initial value conditions, that is, , the fractional linear multistep scheme for the Riemann-Liouville derivative has the following form:
*

*If , the corresponding numerical methods are often called the high-order methods. The coefficients in the above equations are those of the Taylor series expansions of the corresponding generating functions ; that is,
The corresponding generating functions for are given as follows [16]:
Using the similar method, we list the generating functions for ,
*

*From the above introduction, the key question is how to compute the coefficients , . As far as we know, there are three methods to compute these coefficients, in which one way is to use the fast Fourier transform method [19].*

*Another way of computing the coefficients , , is by the automatic differentiation techniques [13]
Here, the values in the above formula denote the Taylor expansion coefficients of the generating functions of the classical linear multistep methods.*

*The third method is to use the expansion of series, where the coefficients are not given in the form of recurrence relationships but the exact expressions; see the Appendix. Such analytical expressions are useful for theoretical analysis, such as stability and convergence. Here, we introduce the second method.*

*2.1. Properties of and *

*As far as we know, the coefficients of the 1st-order and 2nd-order schemes are often used. Here, we present their properties for reference. We know that are the binomial coefficients in formula (12). They have the following properties.*

*Property 1. *The coefficients for have the following properties:(1), , ;(2), ;(3), .

*Parallelly, the properties of the coefficients of the 1st-order schemes for are given as follows.*

*Property* *1*′*.* The coefficients for have the following properties:(1), , , ;(2), ;(3), .

*The above Properties 1 and 1′ are known to us. Next, we present the coefficients which are somewhat complex. Let ; formula (18) can be written as
In case , the corresponding generating function is . So, , , , , , and are coefficients of the Taylor series expansion of ; it is easy to get
From (19), we have
*

*By the tedious calculations, one has the following result.*

*Property 2. *The coefficients for have the following properties:(1), ;
(2), ;(3), .

*Similarly, the coefficients of the 2nd scheme for have the following properties.*

* Property* *2*′*.* The coefficients for have the following properties;(1), ;
(2), ;(3), .

*The proofs of Properties 2 and 2′ can refer to [4].*

*2.2. Determination of *

*In this subsection, we present the recurrence relationships of the coefficients for reference.*

*(1) When , then , , , , , ,
*

*(2) When , then , , , , , , ,
*

*(3) When , then , , , , , , , ,
*

*(4) When , then , , , , , , , , ,
*

*In Figures 1, 2, 3, and 4, we display the coefficients for different ; it can be seen that when , which coincides with the convergence [16].*

*Remark 7. *In [15], the high-order schemes for Caputo derivative were firstly derived. Here, one can get another way to construct the high-order numerical algorithms for Caputo derivatives. If the homogeneous initial value conditions are satisfied, one has the following numerical schemes due to Lemma 5:

*2.3. Determination of *

*In this subsection, we present the recursion formulas of for reference.*

*(1) When , then , , , , , , , , and , . The coefficients are given as follows:
*

*(2) When , then , , , , , , , , , and , . The coefficients are given as follows:
*

*(3) When , then , , , , , , , , , and , , . The coefficients are displayed as follows:
*

*(4) When , then , , , , , , , , , , , and , . The coefficients are given as follows:
*

*Next, we plot the figures of coefficients of to show the evolutions with . From Figures 5, 6, 7, and 8, we can see that these coefficients are violently oscillatory such that the approximation behaves like Runge’s phenomenon, which is similar to the case of ordinary differential equation. So, to seek high-order (≥7th-order) schemes by this form seems not to be appropriate.*

*3. Numerical Examples*

*In order to verify the reasonability of the coefficients for , we give the following two numerical examples. These numerical results show that the coefficients are efficient.*

*Example 8. *Consider the function , . The numerical absolute error and convergence order at by higher-order difference scheme (14) with different are shown in Tables 1, 2, 3, and 4.

*Example 9. *Let us consider a fractional ordinary differential equation
with initial values

*The exact solution of the above equation is given by
*

*At this moment, we use the numerical formula (14) with different order to solve this equation. The absolute error and numerical convergence order are listed in Tables 5, 6, 7, and 8.*

*From the numerical results presented in Tables 1–8, we can see that the coefficients of the fractional linear multistep method for are efficient.*

*The coefficients of are violently oscillatory which may not be suitable for numerical calculations. Now, we take an example to show this.*

*Example 10. *Consider the function , . Consider
We use the scheme (14) with to numerically compute . See Figures 9, 10, 11, and 12. From these figures, we can see that the results are not numerically stable, which can be regarded as fractional Runge’s phenomenon. So, it is not necessary to derive more than 6th-order schemes for Riemann-Liouville derivative by generating function method.

*4. Conclusion*

*In this paper, we propose recursion formulas to compute the coefficients of the fractional linear multistep schemes. The numerical experiments have been carried out to support the derived numerical schemes. Here, we should note that the th order schemes are not stable.*

*Appendix*

*The Computations of Coefficients for Case *

*
Here, we first introduce the Fourier transform method to compute the coefficients for . Letting and substituting it into (15) yield
So, the coefficients can be expressed as
That is, we need compute the following integrals:
*

*Obviously, it is not an easy task to obtain the explicit analytical expressions of the coefficients if . These analytical expressions are seemingly complicated but are very useful for theoretical analysis, such as stability and convergence analysis. In the following, we give an effective and interesting method to obtain the explicit analytical expressions of coefficients . For case , it is easy to get; see [27] for more details,
For cases , the details are given as follows.*

*(i) Consider .*

*By some calculations, one has*