Skip to main content

Advertisement

A shifted Jacobi-Gauss-Lobatto collocation method for solving nonlinear fractional Langevin equation involving two fractional orders in different intervals

Article metrics

  • 20k Accesses

  • 44 Citations

Abstract

In this paper, we develop a Jacobi-Gauss-Lobatto collocation method for solving the nonlinear fractional Langevin equation with three-point boundary conditions. The fractional derivative is described in the Caputo sense. The shifted Jacobi-Gauss-Lobatto points are used as collocation nodes. The main characteristic behind the Jacobi-Gauss-Lobatto collocation approach is that it reduces such a problem to those of solving a system of algebraic equations. This system is written in a compact matrix form. Through several numerical examples, we evaluate the accuracy and performance of the proposed method. The method is easy to implement and yields very accurate results.

1 Introduction

Many practical problems arising in science and engineering require solving initial and boundary value problems of fractional order differential equations (FDEs), see [1, 2] and references therein. Several methods have also been proposed in the literature to solve FDEs (see, for instance, [37]). Spectral methods are relatively new approaches to provide an accurate approximation to FDEs (see, for instance, [811]).

In this work, we propose the shifted Jacobi-Gauss-Lobatto collocation (SJ-GL-C) method to solve numerically the following nonlinear Langevin equation involving two fractional orders in different intervals:

D ν ( D μ + λ ) u(x)=f ( x , u ( x ) ) ,0<μ1,1<ν2,xI=[0,L],
(1)

subject to the three-point boundary conditions

u(0)= s 0 ,u( x 1 )= s 1 ,u(L)= s 2 , x 1 ]0,L[,
(2)

where D ν u(x) u ( ν ) (x) denotes the Caputo fractional derivative of order ν for u(x), λ is a real number, s 0 , s 1 , s 2 are given constants and f is a given nonlinear source function.

The existence and uniqueness of solution of Langevin equation involving two fractional orders in different intervals (0<μ11<ν2) have been studied in [12], and for other choices of ν and μ, see [13, 14].

Fractional Langevin equation is one of the basic equations in the theory of the evolution of physical phenomena in fluctuating environments and provides a more flexible model for fractal processes as compared with the usual ordinary Langevin equation. Moreover, fractional generalized Langevin equation with external force is used to model single-file diffusion. This equation has been the focus of many studies, see, for instance, [1518].

Due to high order accuracy, spectral methods have gained increasing popularity for several decades, especially in the field of computational fluid dynamics (see, e.g., [19] and the references therein). Collocation methods have become increasingly popular for solving differential equations; also, they are very useful in providing highly accurate solutions to nonlinear differential equations [2022]. Bhrawy and Alofi [20] proposed the spectral shifted Jacobi-Gauss collocation method to find the solution of the Lane-Emden type equation. Moreover, Doha et al. [23] developed the shifted Jacobi-Gauss collocation method for solving nonlinear high-order multi-point boundary value problems. To the best of our knowledge, there are no results on Jacobi-Gauss-Lobatto collocation method for three-point nonlinear Langevin equation arising in mathematical physics. This partially motivated our interest in such a method.

The advantage of using Jacobi polynomials for solving differential equations is obtaining the solution in terms of the Jacobi parameters α and β (see [2427]). Some special cases of Jacobi parameters α and β are used for numerically solving various types of differential equations (see [2831]).

The main concern of this paper is to extend the application of collocation method to solve the three-point nonlinear Langevin equation involving two fractional orders in different intervals. It would be very useful to carry out a systematic study on Jacobi-Gauss-Lobatto collocation method with general indexes (α,β>1). The fractional Langevin equation is collocated only at (N2) points; for suitable collocation points, we use the (N2) nodes of the shifted Jacobi-Gauss-Lobatto interpolation (α,β>1). These equations together with the three-point boundary conditions generate (N+1) nonlinear algebraic equations which can be solved using Newton’s iterative method. Finally, the accuracy of the proposed method is demonstrated by test problems.

The remainder of the paper is organized as follows. In the next section, we introduce some notations and summarize a few mathematical facts used in the remainder of the paper. In Section 3, the way of constructing the Gauss-Lobatto collocation technique for fractional Langevin equation is described using the shifted Jacobi polynomials; and in Section 4 the proposed method is applied to some types of Langevin equations. Finally, some concluding remarks are given in Section 5.

2 Preliminaries

In this section, we give some definitions and properties of the fractional calculus (see, e.g., [1, 2, 32]) and Jacobi polynomials (see, e.g., [3335]).

Definition 2.1 The Riemann-Liouville fractional integral operator of order μ (μ0) is defined as

J μ f ( x ) = 1 Γ ( μ ) 0 x ( x t ) μ 1 f ( t ) d t , μ > 0 , x > 0 , J 0 f ( x ) = f ( x ) .
(3)

Definition 2.2 The Caputo fractional derivative of order μ is defined as

D μ f ( x ) = J m μ D m f ( x ) = 1 Γ ( m μ ) 0 x ( x t ) m μ 1 d m d t m f ( t ) d t , m 1 < μ m , x > 0 ,
(4)

where m is an integer number and D m is the classical differential operator of order m.

For the Caputo derivative, we have

D μ x β ={ 0 , for β N 0 and β < μ , Γ ( β + 1 ) Γ ( β + 1 μ ) x β μ , for β N 0 and β μ or β N and β > μ .
(5)

We use the ceiling function μ to denote the smallest integer greater than or equal to μ and the floor function μ to denote the largest integer less than or equal to μ. Also N={1,2,} and N 0 ={0,1,2,}. Recall that for μN, the Caputo differential operator coincides with the usual differential operator of an integer order.

Let α>1, β>1 and P k ( α , β ) (x) be the standard Jacobi polynomial of degree k. We have that

P k ( α , β ) ( x ) = ( 1 ) k P k ( α , β ) ( x ) , P k ( α , β ) ( 1 ) = ( 1 ) k Γ ( k + β + 1 ) k ! Γ ( β + 1 ) , P k ( α , β ) ( 1 ) = Γ ( k + α + 1 ) k ! Γ ( α + 1 ) .
(6)

Besides,

D m P k ( α , β ) (x)= 2 m Γ ( m + k + α + β + 1 ) Γ ( k + α + β + 1 ) P k m ( α + m , β + m ) (x).
(7)

Let w ( α , β ) (x)= ( 1 x ) α ( 1 + x ) β , then we define the weighted space L w ( α , β ) 2 (1,1) as usual, equipped with the following inner product and norm:

( u , v ) w ( α , β ) = 1 1 u(x)v(x) w ( α , β ) (x)dx, v w ( α , β ) = ( v , v ) w ( α , β ) 1 2 .

The set of Jacobi polynomials forms a complete L w α , β 2 (1,1)-orthogonal system, and

P k ( α , β ) w ( α , β ) 2 = h k ( α , β ) = 2 α + β + 1 Γ ( k + α + 1 ) Γ ( k + β + 1 ) ( 2 k + α + β + 1 ) Γ ( k + 1 ) Γ ( k + α + β + 1 ) .
(8)

Let L>0, then the shifted Jacobi polynomial of degree k on the interval (0,L) is defined by P L , k ( α , β ) (x)= P k ( α , β ) ( 2 x L 1).

By virtue of (6), we have that

P L , j ( α , β ) (0)= ( 1 ) j Γ ( j + β + 1 ) Γ ( β + 1 ) j ! .
(9)

Next, let w L ( α , β ) (x)= ( L x ) α x β , then we define the weighted space L w L ( α , β ) 2 (0,L) in the usual way, with the following inner product and norm:

( u , v ) w L ( α , β ) = 0 L u(x)v(x) w L ( α , β ) (x)dx, v w L ( α , β ) = ( v , v ) w L ( α , β ) 1 2 .

The set of shifted Jacobi polynomials is a complete L w L ( α , β ) 2 (0,L)-orthogonal system. Moreover, due to (8), we have

P L , k ( α , β ) w L ( α , β ) 2 = ( L 2 ) α + β + 1 h k ( α , β ) = h L , k ( α , β ) .
(10)

For α=β one recovers the shifted ultraspherical polynomials (symmetric shifted Jacobi polynomials) and for α=β= 1 2 , α=β=0, the shifted Chebyshev of the first and second kinds and shifted Legendre polynomials respectively; and for the nonsymmetric shifted Jacobi polynomials, the two important special cases α=β=± 1 2 (shifted Chebyshev polynomials of the third and fourth kinds) are also recovered.

3 Shifted Jacobi-Gauss-Lobatto collocation method

In this section, we derive the SJ-GL-C method to solve numerically the following model problem:

D ν ( D μ + λ ) u(x)=f(x,u),0<μ1,1<ν2,xI=(0,L),
(11)

subject to the three-point boundary conditions

u(0)= s 0 ,u( x 1 )= s 1 ,u(L)= s 2 , x 1 ]0,L[,
(12)

where D ν u(x) u ( ν ) (x) denotes the Caputo fractional derivative of order ν for u(x)λ is a real number, s 0 s 1 s 2 are given constants and f(x,u) is a given nonlinear source function. For the existence and uniqueness of solution of (11)-(12), see [12].

The choice of collocation points is important for the convergence and efficiency of the collocation method. For boundary value problems, the Gauss-Lobatto points are commonly used. It should be noted that for a differential equation with the singularity at x=0 in the interval [0,L] one is unable to apply the collocation method with Jacobi-Gauss-Lobatto points because the two assigned abscissas 0 and L are necessary to use as a two points from the collocation nodes. Also, a Jacobi-Gauss-Radau nodes with the fixed node x=0 cannot be used in this case. In fact, we use the collocation method with Jacobi-Gauss-Lobatto nodes to treat the nonlinear Langevin differential equation; i.e., we collocate this equation only at the (N2) Jacobi-Gauss-Lobatto points (0,L). These equations together with three-point boundary conditions generate (N+1) nonlinear algebraic equations which can be solved.

Let us first introduce some basic notation that will be used in the sequel. We set

S N (0,L)=span { P L , 0 ( α , β ) ( x ) , P L , 1 ( α , β ) ( x ) , , P L , N ( α , β ) ( x ) } .
(13)

We next recall the Jacobi-Gauss-Lobatto interpolation. For any positive integer N, S N (0,L) stands for the set of all algebraic polynomials of degree at most N. If we denote by x N , j ( α , β ) ( x L , N , j ( α , β ) ), 0jN, and ϖ N , j ( α , β ) ( ϖ L , N , j ( α , β ) ), (0iN), to the nodes and Christoffel numbers of the standard (shifted) Jacobi-Gauss-Lobatto quadratures on the intervals (1,1), (0,L) respectively. Then one can easily show that

For any ϕ S 2 N + 1 (0,L),

0 L w L ( α , β ) ( x ) ϕ ( x ) d x = ( L 2 ) α + β + 1 1 1 ( 1 x ) α ( 1 + x ) β ϕ ( L 2 ( x + 1 ) ) d x = ( L 2 ) α + β + 1 j = 0 N ϖ N , j ( α , β ) ϕ ( L 2 ( x N , j ( α , β ) + 1 ) ) = j = 0 N ϖ L , N , j ( α , β ) ϕ ( x L , N , j ( α , β ) ) .
(14)

We introduce the following discrete inner product and norm:

( u , v ) w L ( α , β ) , N = j = 0 N u ( x L , N , j ( α , β ) ) v ( x L , N , j ( α , β ) ) ϖ L , N , j ( α , β ) , u w L ( α , β ) , N = ( u , u ) w L ( α , β ) , N ,
(15)

where x L , N , j ( α , β ) and ϖ L , N , j ( α , β ) are the nodes and the corresponding weights of the shifted Jacobi-Gauss-quadrature formula on the interval (0,L) respectively.

Due to (14), we have

( u , v ) w L ( α , β ) , N = ( u , v ) w L ( α , β ) ,uv S 2 N 1 .
(16)

Thus, for any u S N (0,L), the norms u w L ( α , β ) , N and u w L ( α , β ) coincide.

Associating with this quadrature rule, we denote by I N P L ( α , β ) the shifted Jacobi-Gauss interpolation,

I N P L ( α , β ) u ( x L , N , j ( α , β ) ) =u ( x L , N , j ( α , β ) ) ,0kN.

The shifted Jacobi-Gauss collocation method for solving (11)-(12) is to seek u N (x) S N (0,T), such that

D μ + ν u N ( x L , N 3 , k ( α , β ) ) + λ D ν u N ( x L , N 3 , k ( α , β ) ) = f ( x L , N 3 , k ( α , β ) , u N ( x L , N 3 , k ( α , β ) ) ) , k = 0 , 1 , , N 3 .
(17)
u N (0)= s 0 , u N ( x 1 )= s 1 , u N (L)= s 2 , x 1 ]0,L[.
(18)

We now derive an efficient algorithm for solving (17)-(18). Let

u N (x)= j = 0 N a j P L , j ( α , β ) (x),a= ( a 0 , a 1 , , a N ) T .
(19)

We first approximate u(x), D μ + ν u(x)and D μ u(x), as Eq. (19). By substituting these approximations in Eq. (11), we get

j = 0 N a j ( D μ + ν P L , j ( α , β ) ( x ) + λ D μ P L , j ( α , β ) ( x ) ) =f ( x , j = 0 N a j P L , j ( α , β ) ( x ) ) .
(20)

Here, the fractional derivative of order μ in the Caputo sense for the shifted Jacobi polynomials expanded in terms of shifted Jacobi polynomials themselves can be represented formally in the following theorem.

Theorem 3.1 Let P L , j ( α , β ) (x)be a shifted Jacobi polynomial of degree j, then the fractional derivative of order ν in the Caputo sense for P L , j ( α , β ) (x)is given by

D ν P L , j ( α , β ) (x)= i = 0 Q ν (j,i,α,β) P L , i ( α , β ) (x),j=ν,ν+1,,
(21)

where

Q ν ( j , i , α , β ) = k = ν j ( 1 ) j k L α + β ν + 1 Γ ( i + β + 1 ) Γ ( j + β + 1 ) Γ ( j + k + α + β + 1 ) h i Γ ( i + α + β + 1 ) Γ ( k + β + 1 ) Γ ( j + α + β + 1 ) Γ ( k ν + 1 ) ( j k ) ! × l = 0 i ( 1 ) i l Γ ( i + l + α + β + 1 ) Γ ( α + 1 ) Γ ( l + k + β ν + 1 ) Γ ( l + β + 1 ) Γ ( l + k + α + β ν + 2 ) ( i l ) ! l ! .

Proof This theorem can be easily proved (see Doha et al. [36]).

In practice, only the first (N+1)-terms shifted Jacobi polynomials are considered, with the aid of Theorem 3.1 (Eq. (21)), we obtain from (20) that

j = 0 N a j ( i = 0 N Q μ + ν ( j , i , α , β ) P L , i ( α , β ) ( x ) + λ i = 0 N Q μ ( j , i , α , β ) P L , i ( α , β ) ( x ) ) = f ( x , j = 0 N a j P L , j ( α , β ) ( x ) ) .
(22)

Also, by substituting Eq. (19) in Eq. (12) we obtain

j = 0 N a j P L , j ( α , β ) ( 0 ) = s 0 , j = 0 N a j P L , j ( α , β ) ( x 1 ) = s 1 , j = 0 N a j P L , j ( α , β ) ( L ) = s 2 . }
(23)

To find the solution u N (x), we first collocate Eq. (22) at the (N2) shifted Jacobi-Gauss-Lobatto notes, yields

j = 0 N a j ( i = 0 N Q μ + ν ( j , i , α , β ) P L , i ( α , β ) ( x L , N 3 , k ( α , β ) ) + λ i = 0 N Q μ ( j , i , α , β ) P L , i ( α , β ) ( x L , N 3 , k ( α , β ) ) ) = f ( ( x L , N 3 , k ( α , β ) ) , j = 0 N a j P L , j ( α , β ) ( x L , N 3 , k ( α , β ) ) ) , 0 k N 3 .
(24)

Next, Eq. (23), after using (9) and (6), can be written as

j = 0 N ( 1 ) j Γ ( j + β + 1 ) Γ ( β + 1 ) j ! a j = s 0 , j = 0 N ( i = 0 j ( 1 ) j i Γ ( j + β + 1 ) Γ ( j + i + α + β + 1 ) Γ ( i + β + 1 ) Γ ( j + α + β + 1 ) ( j i ) ! i ! L i x 1 i ) a j = s 1 , j = 0 N ( i = 0 j ( 1 ) j i Γ ( j + β + 1 ) Γ ( j + i + α + β + 1 ) Γ ( i + β + 1 ) Γ ( j + α + β + 1 ) ( j i ) ! i ! ) a j = s 2 . }
(25)

The scheme (24)-(25) can be rewritten as a compact matrix form. To do this, we introduce the (N+1)×(N+1) matrix A with the entries a k j as follows:

a k j ={ i = 0 N Q μ + ν ( j , i , α , β ) P L , i ( α , β ) ( x L , N 3 , k ( α , β ) ) , 0 k N 3 , μ + ν j N , ( 1 ) j Γ ( j + β + 1 ) Γ ( β + 1 ) j ! , k = N 2 , 0 j N , i = 0 j ( 1 ) j i Γ ( j + β + 1 ) Γ ( j + i + α + β + 1 ) Γ ( i + β + 1 ) Γ ( j + α + β + 1 ) ( j i ) ! i ! L i x 1 i , k = N 1 , 0 j N , i = 0 j ( 1 ) j i Γ ( j + β + 1 ) Γ ( j + i + α + β + 1 ) Γ ( i + β + 1 ) Γ ( j + α + β + 1 ) ( j i ) ! i ! , k = N , 0 j N , 0 , otherwise .

Also, we define the (N+1)×(N+1) matrix B with the entries:

b k j ={ i = 0 N Q μ ( j , i , α , β ) P L , i ( α , β ) ( x L , N 3 , k ( α , β ) ) , 0 k N 3 , μ j N , 0 , otherwise ,

and the (N2)×(N+1) matrix C with the entries:

c k j = P T , j ( α , β ) ( x T , N 3 , k ( α , β ) ) ,0kN3,0jN.

Further, let a= ( a 0 , a 1 , , a N ) T , and

F(a)= ( f ( x T , N 3 , 0 ( α , β ) , u N ( x T , N 3 , 0 ( α , β ) ) ) , , f ( x T , N 3 , N 3 ( α , β ) , u N ( x T , N 3 , N 3 ( α , β ) ) ) , s 0 , s 1 , s 2 ) T ,

where u N ( x T , N 3 , k ( α , β ) ) is the k th component of C a. Then we obtain from (24)-(25) that

(A+λB)a=F(a),

or equivalently

a= ( A + λ B ) 1 F(a).
(26)

Finally, from (26), we obtain (N+1) nonlinear algebraic equations which can be solved for the unknown coefficients a j by using any standard iteration technique, like Newton’s iteration method. Consequently, u N (x) given in Eq. (19) can be evaluated. □

Remark 3.2 In actual computation for fixed μ, ν and λ, it is required to compute ( A + λ B ) 1 only once. This allows us to save a significant amount of computational time.

4 Numerical results

To illustrate the effectiveness of the proposed method in the present paper, two test examples are carried out in this section. Comparison of the results obtained by various choices of Jacobi parameters α and β reveal that the present method is very effective and convenient for all choices of α and β.

We consider the following two examples.

Example 1 Consider the nonlinear fractional Langevin equation

D 7 4 ( D 3 4 + 1 8 ) u(x)= 18 10 ( tan 1 u ( x ) + cos x ) ,inI=(0,1),
(27)

subject to three-point boundary conditions:

u(0)=0,u(0.5)=0,u(1)=0.
(28)

The analytic solution for this problem is not known. In Table 1 we introduce the approximate solution for (27)-(28) using SJ-GL-C method at α=β=0 and N=12. The approximate solutions at α=β= 1 2 and a few collocation points (N=4,6,8,16) of this problem are depicted in Figure 1. The approximate solution at N=8 agrees very well with the approximate solution at N=16; this means the numerical solution converges fast as N increases.

Figure 1
figure1

Comparing the approximate solutions at N=4,6,8,16 , for Example 1.

Table 1 Approximate solution of (27)-(28) using SJ-GL-C method forN=12

Example 2 In this example we consider the following nonlinear fractional Langevin differential equation

D ν ( D μ + 3 ) u(x)= u 3 (x)+ e u ( x ) +g(x),ν(1,2),μ(0,1),
(29)

subject to the following three-point boundary conditions:

u(0)=0,u ( 1 3 ) = 729 125 , 000 ( 10 3 ) 2 μ ν ,u(1)=0,
(30)

where

g ( x ) = e 3 x 5 2 x 6 x 2 μ + ν ( 3 x 5 2 x 6 x 2 μ + ν ) 3 + 360 x 5 μ ν Γ ( 6 μ ν ) 1 , 440 x 6 μ ν Γ ( 7 μ ν ) x μ Γ ( 1 + 2 μ + ν ) Γ ( 1 + μ ) + 3 ( 360 x 5 ν Γ ( 6 ν ) 1 , 440 x 6 ν Γ ( 7 ν ) x 2 μ Γ ( 1 + 2 μ + ν ) Γ ( 1 + 2 μ ) ) .

The exact solution of this problem is u(x)= x ν + 2 μ +3 x 5 2 x 6 .

Numerical results are obtained for different choices of ν, μ, α, β, and N. In Tables 2 and 3 we introduce the maximum absolute error, using the shifted Jacobi collocation method based on Gauss-Lobatto points, with two choices of α, β, and various choices of ν, μ, and N.

Table 2 Maximum absolute error of u u N using SJ-GL-C method for α=β=0
Table 3 Maximum absolute error of u u N using SJ-GL-C method for α=β=1/2

The approximate solutions are evaluated for ν=1.2,1.4,1.6,1.8,2, μ=1, α=β=1 and N=14. The results of the numerical simulations are plotted in Figure 2. In Figure 3, we plotted the approximate solutions at fixed ν=2, and various choices of μ=0.2,0.4,0.6,0.8,1 with α=β=1 and N=14. It is evident from Figure 2 and Figure 3 that, as ν and μ approach close to 2 and 1, the numerical solution by shifted Jacobi-Gauss-Lobatto collocation method with α=β=1 for fractional order differential equation approaches to the solution of integer order differential equation.

Figure 2
figure2

Approximate solution for ν=1.2,1.4,1.6,1.8,2 , μ=1 with 14 nodes and the exact solution at ν=2 and μ=1 , for Example 2.

Figure 3
figure3

Approximate solution for μ=0.2,0.4,0.6,0.8,1 , ν=2 with 14 nodes and the exact solution at ν=2 and μ=1 , for Example 2.

In the case of 1<ν2, μ=1 with α=β= 1 2 , and N=14, the results of the numerical simulations are shown in Figure 4. In Figure 5, we plotted the approximate solutions for ν=2, 0<μ1 with α=β= 1 2 , and N=14. In fact, the approximate solutions obtained by the present method at 1<ν2, 0<μ1 with N=14 are shown in Figure 4 and Figure 5 to make it easier to show that; as ν and μ approach to their integer values, the solution of fractional order Langevin equation approaches to the solution of integer order Langevin differential equation.

Figure 4
figure4

Approximate solution for 1<ν2 , μ=1 with 12 nodes, for Example 2.

Figure 5
figure5

Approximate solution for 0<μ1 , ν=2 with 12 nodes, for Example 2.

5 Conclusion

An efficient and accurate numerical scheme based on the Jacobi-Gauss-Lobatto collocation spectral method is proposed for solving the nonlinear fractional Langevin equation. The problem is reduced to the solution of nonlinear algebraic equations. Numerical examples were given to demonstrate the validity and applicability of the method. The results show that the SJ-GL-C method is simple and accurate. In fact, by selecting a few collocation points, excellent numerical results are obtained.

References

  1. 1.

    Magin RL: Fractional Calculus in Bioengineering. Begell House Publishers, New York; 2006.

  2. 2.

    Das S: Functional Fractional Calculus for System Identification and Controls. Springer, New York; 2008.

  3. 3.

    Jafari H, Yousefi SA, Firoozjaee MA, Momanic S, Khalique CM: Application of Legendre wavelets for solving fractional differential equations. Comput. Math. Appl. 2011, 62: 1038-1045. 10.1016/j.camwa.2011.04.024

  4. 4.

    Bhrawy AH, Alofi AS: The operational matrix of fractional integration for shifted Chebyshev polynomials. Appl. Math. Lett. 2012.

  5. 5.

    Lotfi A, Dehghan M, Yousefi SA: A numerical technique for solving fractional optimal control problems. Comput. Math. Appl. 2011, 62: 1055-1067. 10.1016/j.camwa.2011.03.044

  6. 6.

    Lakestani M, Dehghan M, Irandoust-pakchin S: The construction of operational matrix of fractional derivatives using B-spline functions. Commun. Nonlinear Sci. Numer. Simul. 2012, 17: 1149-1162. 10.1016/j.cnsns.2011.07.018

  7. 7.

    Pedas A, Tamme E: Piecewise polynomial collocation for linear boundary value problems of fractional differential equations. J. Comput. Appl. Math. 2012.

  8. 8.

    Bhrawy AH, Alofi AS, Ezz-Eldien SS: A quadrature tau method for variable coefficients fractional differential equations. Appl. Math. Lett. 2011, 24: 2146-2152. 10.1016/j.aml.2011.06.016

  9. 9.

    Bhrawy AH, Alshomrani M: A shifted Legendre spectral method for fractional-order multi-point boundary value problems. Adv. Differ. Equ. 2012., 2012:

  10. 10.

    Doha EH, Bhrawy AH, Ezz-Eldien SS: Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations. Appl. Math. Model. 2011, 35: 5662-5672. 10.1016/j.apm.2011.05.011

  11. 11.

    Doha EH, Bhrawy AH, Ezz-Eldien SS: A Chebyshev spectral method based on operational matrix for initial and boundary value problems of fractional order. Comput. Math. Appl. 2011, 62: 2364-2373. 10.1016/j.camwa.2011.07.024

  12. 12.

    Ahmad B, Nieto JJ, Alsaedi A, El-Shahed M: A study of nonlinear Langevin equation involving two fractional orders in different intervals. Nonlinear Anal., Real World Appl. 2012, 13: 599-606. 10.1016/j.nonrwa.2011.07.052

  13. 13.

    Ahmad B, Nieto JJ: Solvability of nonlinear Langevin equation involving two fractional orders with Dirichlet boundary conditions. Int. J. Differ. Equ. 2010., 2010:

  14. 14.

    Chen A, Chen Y: Existence of solutions to nonlinear Langevin equation involving two fractional orders with boundary value conditions. Bound. Value Probl. 2011., 2011:

  15. 15.

    Fa KS: Fractional Langevin equation and Riemann-Liouville fractional derivative. Eur. Phys. J. E 2007, 24: 139-143. 10.1140/epje/i2007-10224-2

  16. 16.

    Picozzi S, West B: Fractional Langevin model of memory in financial markets. Phys. Rev. E 2002, 66: 46-118.

  17. 17.

    Lim SC, Li M, Teo LP: Langevin equation with two fractional orders. Phys. Lett. A 2008, 372: 6309-6320. 10.1016/j.physleta.2008.08.045

  18. 18.

    Eab CH, Lim SC: Fractional generalized Langevin equation approach to single-file diffusion. Physica A 2010, 389: 2510-2521. 10.1016/j.physa.2010.02.041

  19. 19.

    Canuto C, Hussaini MY, Quarteroni A, Zang TA: Spectral Methods in Fluid Dynamics. Springer, New York; 1988.

  20. 20.

    Bhrawy AH, Alofi AS: A Jacobi-Gauss collocation method for solving nonlinear Lane-Emden type equations. Commun. Nonlinear Sci. Numer. Simul. 2012, 17: 62-70. 10.1016/j.cnsns.2011.04.025

  21. 21.

    Guo B-Y, Yan J-P: Legendre-Gauss collocation method for initial value problems of second order ordinary differential equations. Appl. Numer. Math. 2009, 59: 1386-1408. 10.1016/j.apnum.2008.08.007

  22. 22.

    Saadatmandi A, Dehghan M: The use of sinc-collocation method for solving multi-point boundary value problems. Commun. Nonlinear Sci. Numer. Simul. 2012, 17: 593-601. 10.1016/j.cnsns.2011.06.018

  23. 23.

    Doha EH, Bhrawy AH, Hafez RM: On shifted Jacobi spectral method for high-order multi-point boundary value problems. Commun. Nonlinear Sci. Numer. Simul. 2012, 17: 3802-3810. 10.1016/j.cnsns.2012.02.027

  24. 24.

    Doha EH, Bhrawy AH: Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials. Appl. Numer. Math. 2008, 58: 1224-1244. 10.1016/j.apnum.2007.07.001

  25. 25.

    Doha EH, Bhrawy AH: A Jacobi spectral Galerkin method for the integrated forms of fourth-order elliptic differential equations. Numer. Methods Partial Differ. Equ. 2009, 25: 712-739. 10.1002/num.20369

  26. 26.

    El-Kady M: Jacobi discrete approximation for solving optimal control problems. J. Korean Math. Soc. 2012, 49: 99-112.

  27. 27.

    Doha EH, Abd-Elhameed WM, Youssri YH: Efficient spectral-Petrov-Galerkin methods for the integrated forms of third- and fifth-order elliptic differential equations using general parameters generalized Jacobi polynomials. Appl. Math. Comput. 2012, 218: 7727-7740. 10.1016/j.amc.2012.01.031

  28. 28.

    Xie, Z, Wang, L-L, Zhao, X: On exponential convergence of Gegenbauer interpolation and spectral differentiation. Math. Comput. (2012, in press)

  29. 29.

    Liu F, Ye X, Wang X: Efficient Chebyshev spectral method for solving linear elliptic PDEs using quasi-inverse technique. Numer. Math. Theor. Meth. Appl. 2011, 4: 197-215.

  30. 30.

    Zhu L, Fan Q: Solving fractional nonlinear Fredholm integro-differential equations by the second kind Chebyshev wavelet. Commun. Nonlinear Sci. Numer. Simul. 2012, 17: 2333-2341. 10.1016/j.cnsns.2011.10.014

  31. 31.

    Doha EH, Bhrawy AH: An efficient direct solver for multidimensional elliptic Robin boundary value problems using a Legendre spectral-Galerkin method. Comput. Math. Appl. 2012.

  32. 32.

    Podlubny I: Fractional Differential Equations. Academic Press, San Diego; 1999.

  33. 33.

    Szegö G: Orthogonal Polynomials. 1985.

  34. 34.

    Doha EH: On the coefficients of differentiated expansions and derivatives of Jacobi polynomials. J. Phys. A, Math. Gen. 2002, 35: 3467-3478. 10.1088/0305-4470/35/15/308

  35. 35.

    Doha EH: On the construction of recurrence relations for the expansion and connection coefficients in series of Jacobi polynomials. J. Phys. A, Math. Gen. 2004, 37: 657-675. 10.1088/0305-4470/37/3/010

  36. 36.

    Doha EH, Bhrawy AH, Ezz-Eldien SS: A new Jacobi operational matrix: an application for solving fractional differential equations. Appl. Math. Model. 2012.

Download references

Acknowledgements

This study was supported by the Deanship of Scientific Research of King Abdulaziz University. The authors would like to thank the editor and the reviewers for their constructive comments and suggestions to improve the quality of the article.

Author information

Correspondence to Ali H Bhrawy.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

The authors have equal contributions to each part of this article. All the authors read and approved the final manuscript.

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Authors’ original file for figure 2

Authors’ original file for figure 3

Authors’ original file for figure 4

Authors’ original file for figure 5

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Keywords

  • fractional Langevin equation
  • three-point boundary conditions
  • collocation method
  • Jacobi-Gauss-Lobatto quadrature
  • shifted Jacobi polynomials