/ / Article
Special Issue

## Analysis of Fractional Dynamic Systems

View this Special Issue

Research Article | Open Access

Volume 2014 |Article ID 982413 | 9 pages | https://doi.org/10.1155/2014/982413

# Leapfrog/Finite Element Method for Fractional Diffusion Equation

Accepted17 Feb 2014
Published03 Apr 2014

#### Abstract

We analyze a fully discrete leapfrog/Galerkin finite element method for the numerical solution of the space fractional order (fractional for simplicity) diffusion equation. The generalized fractional derivative spaces are defined in a bounded interval. And some related properties are further discussed for the following finite element analysis. Then the fractional diffusion equation is discretized in space by the finite element method and in time by the explicit leapfrog scheme. For the resulting fully discrete, conditionally stable scheme, we prove an -error bound of finite element accuracy and of second order in time. Numerical examples are included to confirm our theoretical analysis.

#### 1. Introduction

Fractional calculus and fractional partial differential equations (FPDEs) have many applications in various aspects such as in viscoelastic mechanics, power-law phenomenon in fluid and complex network, allometric scaling laws in biology and ecology, colored noise, electrode-electrolyte polarization, dielectric polarization, boundary layer effects in ducts, electromagnetic waves, quantitative finance, quantum evolution of complex systems, and fractional kinetics . And a lot of attention has recently been paid to the problem of the numerical approximation of FPDEs.

Generally speaking, the finite difference method and the finite element method are the two main means to solve FPDEs. Recently, some typical fractional difference methods have been utilized to solve FPDEs numerically . On the other hand, the finite element method has also been used to find the variational solution of FPDEs . But there are still some interesting schemes that can be constructed to enhance the convergence order by using the finite difference/finite element mixed method.

In this paper, we use the explicit leapfrog difference/Galerkin finite element mixed method to numerically solve the space fractional diffusion equation in order to get a higher convergence order.

The fractional diffusion equation as a typical kind of fractional partial differential equation  is a generalization of the classical diffusion equation, which can be used to better characterize anomalous diffusion phenomena. Besides, the spatial fractional diffusion equation usually describes the Lévy flights. The operator is commonly referred to the left (right) sided Lévy stable distribution, where the underlying stochastic process is Lévy -stable flights; see . And a more general form is widely used for mathematical modelling and numerical computation.

Here, we mainly focus on constructing and analyzing a kind of efficient numerical schemes for approximately solving space fractional diffusion equation. The considered problem reads as follows: for , where , time . Here the spatial fractional differential operator is denoted by , where , , and . When , the problem models a Brownian diffusion process. And is a source term, is a positive constant.

The rest of this paper is constructed as follows. In Section 2, the preliminary knowledge of fractional derivative and the generalized fractional derivative spaces are defined. And some related properties are further discussed. The approximate system of the equation, existence and uniqueness of the weak solution, and the error estimates of the fully discrete scheme for (1) are studied in Section 3. In Section 4, numerical examples are presented to demonstrate the efficiency of the theoretical results derived in Section 3.

#### 2. Generalized Fractional Derivative Spaces

In this section, we first give the definition of fractional derivatives. There are several definitions for the fractional derivatives, but Riemann-Liouville derivative is one of the most often used fractional derivatives, which is a reasonable generalization of the classical derivative [1, 1922]. Then we define the generalized fractional derivative spaces by using Riemann-Liouville derivative, which is extended from the sense to the sense.

Definition 1. The th order left and right Riemann-Liouville integrals of function are defined in a finite interval as follows: where .

Definition 2. The th order left and right Riemann-Liouville derivatives of function defined in a finite interval are given as in which . Obviously, they are the integer derivatives of the left and right fractional integrals, respectively.

Now, we give some lemmas and corollaries which are necessary to define the generalized fractional derivative spaces.

Lemma 3 (see ). Let be bounded and . Then satisfies

Lemma 4 (fractional integration by parts, see ). The relation is valid under the assumption that with , in the case .

Corollary 5 (see ). The formula is valid under the assumption that , , , where the function space , , , .

Corollary 6 (see ). One can further give the following corollary: under the assumption that , , .

Note that the above assumption implies one can prove that by using Lemma 3.

Corollary 7 (see ). Consider under the assumption that , , .

Note that, from the definition of the function space , we can get that if , then , and , where , such that , which is obtained by Lemma 3. And naturally holds. So, by the above idea, we define the following fractional derivative spaces from the sense to the sense, which will be proved to be equivalent with the fractional Sobolev spaces under some certain conditions.

Definition 8. Define the following norms of the left (with symbol ) fractional derivative space and the right (with symbol ) fractional derivative space in a bounded interval as follows correspondingly, where : equipped with seminorm and norm equipped with seminorm and norm

Definition 9. Define the symmetric fractional derivative space (with symbol ) in a bounded interval in the sense equipped with seminorm and norm

Definition 10. Define the spaces , , and as the closures of under their respective norms.

From , we can get the following lemma, which is true in the sense.

Lemma 11. The spaces , , , and are equal to equivalent seminorms and norms, where is the fractional Sobolev space in terms of the Fourier transform.

Therefore, in this paper we always use when , to denote the fractional derivative space equipped with the norm which can be any one of (12), (15), and (18), and is denoted as the dual space of , with norm .

Moreover, we can present some new properties about norms for the above left and right fractional derivative spaces in the sense.

Lemma 12. Let and be bounded. Then the following mapping properties hold:(1) is a bounded linear operator;(2) is a bounded linear operator;(3) is a bounded linear operator;(4) is a bounded linear operator;(5) is a bounded linear operator;(6) is a bounded linear operator.

Proof. Properties (1) and (2) follow directly from Lemma 3.
Property (3) follows directly from the definition of and as Property (4) follows similarly.
Property (5) follows from the definition of and the semigroup property of fractional operator, Using Lemma 3, there exist constants , such that Therefore, we obtain the bound Property (6) follows similarly.

Corollary 13. Consider for . And if , one has

It is obviously true by using the norms of fractional derivative spaces and imbedding theorems for .

Lemma 14. Let be bounded. Then for , one has and for , one has

Proof. If by using Lemmas 3 and 12, we have that Therefore, (25) is true. And the following inequality certainly holds: So, we get that Therefore, (26) holds.

#### 3. Error Estimates of the Leapfrog/Finite Element Scheme

In this section, we firstly give a fully discrete scheme, where we use the leapfrog difference method in the temporal direction and the finite element method in the spatial direction and then analyze the error estimate. Let denote a uniform partition on , with grid parameter . For , let denote the space of polynomials on with degree not greater than . Then we define as the finite element space on with the basis of the piecewise polynomials of order ; that is, in which is the unit of .

The following property of finite element spaces is necessary for our subsequent analysis : for , , there exists such that The Gronwall’s lemma is also needed for the error analysis.

Lemma 15 (discrete Gronwall’s lemma, see ). Let , and , , , (for integer be nonnegative numbers such that for . Suppose that for all , and set ; then for .

In the following, we give the fully discrete scheme of (1). Let denote the step size for so that , . For notational convenience, we denote and

Let of (1) be the finite element solution at time of the following fully discrete scheme: that is, where is denoted by an inner product and . For brevity, we always use instead of the right hand side of this equation.

Lemma 16. For a sufficient small step size , there exists a unique solution satisfying (36).

Proof. Firstly, we prove that is positive, which is one of the sufficient conditions for the existence and uniqueness of .
For chosen sufficiently small, we have that Besides, by using the fractional Poincare-Friedrichs formula, we can easily get the continuity of . Hence, by using the Lax-Milgram theorem, we have that (36) is uniquely solvable for .

Now, we carry out the error analysis for the fully discrete problem. The following norms are also used in the analysis:

Theorem 17. Assume that (1) has a solution satisfying , , and , with . is the solution of (36), and is computed in such a way that Then, there exists a constant independent of and , such that if then the finite element approximation (36) is convergent to the solution of (1) on the interval as , . And the approximation solution satisfies the following error estimates:

Proof. In order to estimate (41) and (42), we first discuss the error at ,  . Let represent the solution of (1), define , and for , define and as , . So, we have .
Obviously the true solution of this problem (1) also satisfies Therefore, subtracting (36) from (43) gives that is, Substituting , into (45) leads to After adding to both sides of (46), we obtain the identity Define now the quantity , for , by We can rewrite (47) as Denoting then (49) can be abbreviated as
We now estimate each term in . For the second term of the right hand side, one has where For the third term of the right hand side, one has in which For the fourth term of the right hand side, one has And for the term , by using the Cauchy-Schwarz inequality, we obtain where by Taylor’s theorem Hence, summing from to , one has that is,
We now show that, under our stability assumption (40), is positive and comparable to . To this end, we use the inverse inequality , , and this yields Hence, if is sufficiently small such that , we get So we have that
Therefore, we obtain Hence, By using the discrete Gronwall’s Lemma 15, we have where denoting , , .

Now denoting and using the condition (39), we get that By using the interpolation property and the following result estimate (41) follows.

Using estimate (66) and approximation properties, we have which yields estimate (42).

#### 4. Numerical Examples for Piecewise Linear Polynomials

Let denote a uniform partition on and the space of continuous piecewise linear functions on ; that is, . Then we use the Galerkin finite element method for the spatial variables. After the spatial discretization, we get classical ODEs systems with variables , . In order to satisfy the condition (39) in Theorem 17, we use the two-order Runge-Kutta method to compute the variable .

In this section, we present numerical calculations which support the error estimates in Theorem 17. If we suppose , then we have the convergence rate

Example 1. (i) Let then is the exact solution to the problem where , , , , , and The experiential error results and convergence rates are presented in Table 1.
(ii) Let be the exact solution to the problem where , , , , , and   is numerically obtained.

 cv. rate cv. rate — — 1.3869 2.2470 3.4098 3.8899 1.8014 1.6474 1.1551 1.1338

The experiential error results and convergence rates are displayed in Table 2.

 cv. rate