Comparison of Numerical Approximations of One-Dimensional Space Fractional Diffusion Equation Using Different Types of Collocation Points in Spectral Method Based on Lagrange’s Basis Polynomials ()

Mushfika Hossain Nova^{1}, Hasib Uddin Molla^{2*}, Sajeda Banu^{2}

^{1}Institute of Natural Sciences, United International University, Dhaka, Bangladesh.

^{2}Department of Mathematics, University of Dhaka, Dhaka, Bangladesh.

**DOI: **10.4236/ajcm.2017.74034
PDF HTML XML
844
Downloads
1,508
Views
Citations

Recently many research works have been conducted and published regarding fractional order differential equations. There are several approaches available for numerical approximations of the solution of fractional order diffusion equations. Spectral collocation method based on Lagrange’s basis polynomials to approximate numerical solutions of one-dimensional (1D) space fractional diffusion equations are introduced in this research paper. The proposed form of approximate solution satisfies non-zero Dirichlet’s boundary conditions on both boundaries. Collocation scheme produce a system of first order Ordinary Differential Equations (ODE) from the fractional diffusion equation. We applied this method with four different sets of collocation points to compare their performance.

Keywords

Fractional Diffusion Equation, Spectral Method, Collocation Method, Lagrange’s Basis Polynomial

Share and Cite:

Nova, M. , Molla, H. and Banu, S. (2017) Comparison of Numerical Approximations of One-Dimensional Space Fractional Diffusion Equation Using Different Types of Collocation Points in Spectral Method Based on Lagrange’s Basis Polynomials. *American Journal of Computational Mathematics*, **7**, 469-480. doi: 10.4236/ajcm.2017.74034.

1. Introduction

In recent times, a huge number of research articles have been published by researchers around the world regarding development of various methods for fractional differential equations. The sudden growth of attention around fractional differential equation is because of its use to describe complex physical phenomena like super diffusive process in diverse fields has also been explored. Such applications are cited in [1] . One-dimensional fractional partial differential equations can be put into two immediate categories: space fractional and time fractional differential equations. The order of the spatial derivative has a fractional value instead of integer value in space fractional partial differential equations. Among fractional partial differential equations diffusion and wave equations are most popular. 1D space fractional diffusion equation, contrary to classical diffusion equation spatial derivative will have fractional order rather than integral order; will be considered here in our research. Fractional derivative which is associated here is Caputo fractional derivative.

Several popular approaches have been introduced by researchers for numerical approximations of both space and time fractional diffusion and wave equations. Among them spectral collocation method is the most popular and effective. In spectral collocation method there are wide ranges of polynomials and set of collocation points which are available to choose from. Khader [2] used Chebyshev spectral collocation method to reduce space fractional diffusion equation into a system of ODE for time variable and then solved the system by finite difference method. He chose Chebyshev polynomials for space variable along with roots of shifted Chebyshev polynomials as collocation points. Azizi and Loghmani [3] also used Chebyshev spectral collocation method but they reduced the fractional diffusion equation into a set of algebraic equations using Chebyshev polynomials and Gauss-Lobatto nodes in both space and time domain. Xie et al. [4] also used Chebyshev polynomials to express the solution both in space and time but used Tau method to transform the fractional convection diffusion equation into a system of linear algebraic equations. Bhrawy [5] used shifted Legendre polynomials with Gauss-Lobatto nodes in space for a 2D space fractional diffusion equation and hence reduced it to a system of ODE which is then solved by fourth-order implicit Runge-Kutta method. Lin and Xu [6] introduced a method where they applied Legendre spectral scheme in space and finite difference in time to approximate the solution of time fractional diffusion equation. Bahsi and Yalcinbas [7] reduced the fractional order diffusion equation into a system of linear algebraic equations by expanding trial solution in terms of Fibonacci polynomials in both space and time and then using collocation technique with evenly spaced collocation points. Pirim and Ayaz [8] introduced Hermite collocation method with evenly spaced nodes for numerical approximations of fractional order system of differential equations. Huang and Zheng [9] presented a spectral method to calculate fractional derivative described in Riemann-Liouville sense using Jacobi orthogonal polynomials. They also discussed spectral collocation method based on Lagrange’s basis polynomials and Gauss-Lobatto nodes. With these methods they solve space fractional diffusion equation that have Dirichlet’s boundary conditions; zero in one boundary and non-zero in another. Spectral expansion with Lagrange interpolation polynomial is used for both space and time by Huang [10] for numerical approximations of time fractional differential equations. He used Jacobi-Gauss nodes in time domain and Gauss-Lobatto nodes in space as collocation points.

In this research paper, we will present a spectral collocation method where approximate solution will be expressed in terms of Lagrange’s basis polynomials in space and then a system of first order ODE for time variable is generated by collocation scheme from space fractional diffusion equation. In our proposed technique, approximate solution satisfies non-zero Dirichlet’s boundary conditions on both boundaries. We considered four different sets of collocation points to demonstrate their performance into proposed spectral collocation scheme. The four sets of collocation points are generated from Gauss-Lobatto nodes, roots of Chebyshev polynomials of first kind, roots of Legendre polynomials and equally spaced nodes over the space domain.

Remaining of this research paper is presented as follows: Preliminaries of Caputo fractional derivative and brief introduction of different polynomials are given in Section 2. Then detailed Spectral collocation scheme based on Lagrange’s basis polynomials along with error calculation are provided in Section 3. After that in Section 4, numerical solutions of two examples of space fractional diffusion equation are generated using four different sets of collocation points and absolute local error curves are given. Finally, Section 5 deals with the conclusion.

2. Preliminaries

Caputo Fractional Derivative: Caputo fractional derivative operator of order α is denoted by ${D}^{\alpha}$ and defined by:

${D}^{\alpha}f\left(x\right)=\frac{1}{\text{\Gamma}\left(m-\alpha \right)}\underset{0}{\overset{x}{{\displaystyle \int}}}\frac{{f}^{\left(m\right)}\left(t\right)}{{\left(x-t\right)}^{\alpha -m+1}}\text{d}t,\text{\hspace{0.17em}}\alpha >0$ (1)

with $m-1<\alpha <m,m\in \mathbb{N},x>0,x\in \mathbb{R}$ .

Then for a constant $c$ , we have ${D}^{\alpha}c=0$ and

${D}^{\alpha}{x}^{n}=\{\begin{array}{ll}0,\hfill & \text{for}\text{\hspace{0.17em}}n\in {\mathbb{N}}_{0}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}n<\lceil \alpha \rceil \hfill \\ \frac{\text{\Gamma}\left(n+1\right)}{\text{\Gamma}\left(n+1-\alpha \right)}{x}^{n-\alpha},\hfill & \text{for}\text{\hspace{0.17em}}n\in {\mathbb{N}}_{0}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}n\ge \lceil \alpha \rceil \hfill \end{array}$ (2)

where ${\mathbb{N}}_{0}=\left\{0,1,2,3,\cdots \right\}$ and $\mathbb{N}=\left\{1,2,3,\cdots \right\}$ .

Like classical integer order derivative, Caputo fractional order derivative is also a linear operator. Also it is evident from Equation (2) that for $\alpha \in \mathbb{N}$ , Caputo fractional order derivative coincides with the classical integer order derivative.

Lagrange Basis Polynomials: For $\left(p+1\right)$ points ${x}_{1},{x}_{2},\cdots ,{x}_{p},{x}_{p+1}$ Lagrange basis polynomials ${L}_{n}\left(x\right);n=1,2,\cdots ,p+1$ is defined as follows:

$pp\left(x\right)=\underset{k=1}{\overset{p+1}{{\displaystyle \prod}}}\left(x-{x}_{k}\right)$ (3)

${L}_{n}\left(x\right)=\frac{pp\left(x\right)}{p{p}^{\prime}\left(x\right)\left(x-{x}_{n}\right)}=\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(n,r\right){x}^{r};\text{\hspace{0.17em}}n=1,2,\cdots ,p+1$ (4)

with the property ${L}_{n}\left({x}_{m}\right)={\delta}_{mn}$ , where ${\delta}_{mn}$ is the kronecker delta function. Here $w\left(n,r\right)$ is the coefficient of ${x}^{r}$ in ${L}_{n}\left(x\right)$ and $p{p}^{\prime}\left(x\right)$ is the derivative of $pp\left(x\right)$ .

Legendre Polynomials: Legendre polynomials ${P}_{n}\left(w\right)$ are solutions of the Legendre differential equations and are orthogonal over the domain $\left[-1,1\right]$ . Explicit formula for ${P}_{n}\left(w\right)$ is

${P}_{n}\left(w\right)=\underset{k=0}{\overset{n}{{\displaystyle \sum}}}\left(\begin{array}{c}n\\ k\end{array}\right)\left(\begin{array}{c}-n-1\\ k\end{array}\right){\left(\frac{1-w}{2}\right)}^{k}$ (5)

Chebyshev Polynomials: Chebyshev polynomials ${T}_{n}\left(y\right)$ are solutions of the Chebyshev differential equations and are orthogonal over the domain $\left[-1,1\right]$ . Explicit formula for ${T}_{n}\left(y\right)$ is

${T}_{n}\left(y\right)={y}^{n}\underset{k=0}{\overset{\lfloor \frac{n}{2}\rfloor}{{\displaystyle \sum}}}\left(\begin{array}{c}n\\ 2k\end{array}\right){\left(1-{y}^{-2}\right)}^{k}$ (6)

Roots of Legendre and Chebyshev polynomials are within the interval $\left(-1,1\right)$ , later in Section 4, we shifted these roots to the required interval according to the problem.

3. Spectral Collocation with Lagrange’s Basis Polynomial

Here we present spectral collocation method which is based on Lagrange’s basis polynomials for numerical approximations of the solution of following 1D space fractional diffusion equation:

$\frac{\partial u\left(x,t\right)}{\partial t}=d\left(x,t\right)\frac{{\partial}^{\alpha}u\left(x,t\right)}{\partial {x}^{\alpha}}+s\left(x,t\right);\text{\hspace{0.17em}}\text{\hspace{0.17em}}a<x<b,\text{\hspace{0.17em}}0\le t\le T$ (7)

$u\left(x,0\right)={u}^{0}\left(x\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}a<x<b$ (8)

$u\left(a,t\right)={v}_{1}\left(t\right)\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u\left(b,t\right)={v}_{p+1}\left(t\right)$ (9)

Here parameter $\alpha $ represents the fractional order of spatial derivative where $1<\alpha \le 2$ and associated fractional derivative described in Caputo sense. Equation (8) is the initial condition; Equation (9) is the boundary condition, $d\left(x,t\right)$ is the diffusion coefficient and $s\left(x,t\right)$ is known as source function. With $\alpha =2$ , Equation (7) is the classical diffusion equation.

To approximate numerical solution of fractional diffusion equation given in Equation (7), we first divide the space domain $\left[a,b\right]$ into $p$ parts that results into following $\left(p+1\right)$ points along with boundary points:

$a={x}_{1}<{x}_{2}<\cdots <{x}_{p}<{x}_{p+1}=b$

Later in this section we use these points as collocation points and these points can be chosen from anywhere within the domain in no specific pattern.

Now using Equations (3), (4) and above points we can form Lagrange’s basis polynomials ${L}_{n}\left(x\right)$ for $n=1,2,\cdots ,\left(p+1\right)$ .

We approximate the solution $u\left(x,t\right)$ of the fractional diffusion equation as ${u}_{p}\left(x,t\right)$ by finite sum of Lagrange’s basis polynomials ${L}_{n}\left(x\right)$ :

${u}_{p}\left(x,t\right)=\underset{n=1}{\overset{p+1}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{v}_{n}\left(t\right){L}_{n}\left(x\right)$ (10)

$={v}_{1}\left(t\right){L}_{1}\left(x\right)+\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{v}_{n}\left(t\right){L}_{n}\left(x\right)+{v}_{p+1}\left(t\right){L}_{p+1}(x)$

$={v}_{1}\left(t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}w\left(1,r\right){x}^{r}+\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(n,r\right){v}_{n}\left(t\right){x}^{r}+{v}_{p+1}\left(t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(p+1,r\right){x}^{r}$

$=\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\left({v}_{1}\left(t\right)w\left(1,r\right)+{v}_{p+1}\left(t\right)w\left(p+1,r\right)\right){x}^{r}+\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(n,r\right){v}_{n}\left(t\right){x}^{r}$ (11)

The unknowns ${v}_{n}\left(t\right),n=2,3,\cdots ,p$ in the trial solution needed to be determined. It is clear that this trial solution ${u}_{p}\left(x,t\right)$ automatically satisfies conditions on both boundaries: $u\left(a,t\right)={v}_{1}\left(t\right)$ and $u\left(b,t\right)={v}_{p+1}\left(t\right)$ . With the form of trial solution given in Equations (10), (11) and from the definition of fractional derivative given in Equation (2) along with its linear property we can write the required derivatives of trial solution as

$\frac{\partial {u}_{p}}{\partial t}=\underset{n=1}{\overset{p+1}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{L}_{n}\left(x\right)\frac{\text{d}{v}_{n}\left(t\right)}{\text{d}t}$ (12)

and

$\begin{array}{c}\frac{{\partial}^{\alpha}{u}_{p}}{\partial {x}^{\alpha}}=\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\left({v}_{1}\left(t\right)w\left(1,r\right)+{v}_{p+1}\left(t\right)w\left(p+1,r\right)\right){D}^{\alpha}\left({x}^{r}\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}w\left(n,r\right){v}_{n}\left(t\right){D}^{\alpha}\left({x}^{r}\right)\end{array}$ (13)

Now using above two derivatives of trial solution from Equations (12) & (13) into Equation (7) we have

$\begin{array}{c}\underset{n=1}{\overset{p+1}{{\displaystyle \sum}}}\text{\hspace{0.05em}}{L}_{n}\left(x\right)\frac{\text{d}{v}_{n}\left(t\right)}{\text{d}t}=d\left(x,t\right)\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(n,r\right){v}_{n}\left(t\right){D}^{\alpha}\left({x}^{r}\right)+s\left(x,t\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+d\left(x,t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\left({v}_{1}\left(t\right)w\left(1,r\right)+{v}_{p+1}\left(t\right)w\left(p+1,r\right)\right){D}^{\alpha}\left({x}^{r}\right)\end{array}$ (14)

Then using trial solution from Equation (10) into Equation (8) we have

${u}_{p}\left(x,0\right)={u}^{0}(x)$

$\Rightarrow {v}_{1}\left(0\right){L}_{1}\left(x\right)+\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{v}_{n}\left(0\right){L}_{n}\left(x\right)+{v}_{p+1}\left(0\right){L}_{p+1}\left(x\right)={u}^{0}(x)$

$\Rightarrow \underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{v}_{n}\left(0\right){L}_{n}\left(x\right)={u}^{0}\left(x\right)-{v}_{p+1}\left(0\right){L}_{1}\left(x\right)-{v}_{p+1}\left(0\right){L}_{p+1}\left(x\right)$ (15)

In the trial solution there are $\left(p-1\right)$ unknowns ${v}_{n}\left(t\right);n=2,3,\cdots ,p$ and among $\left(p+1\right)$ points ${x}_{i};i=1,2,3,\cdots ,p,\left(p+1\right)$ trial solution automatically satisfies the boundary conditions at $a={x}_{1}$ and $b={x}_{p+1}$ . So, in collocation method to determine the unknowns we will force Equations (14) & (15) to satisfy at each ${x}_{i};i=2,3,\cdots ,p$ . That means from Equation (14) we write

$\begin{array}{l}\underset{n=1}{\overset{p+1}{{\displaystyle \sum}}}\text{\hspace{0.05em}}{L}_{n}\left({x}_{i}\right)\frac{\text{d}{v}_{n}\left(t\right)}{\text{d}t}=d\left({x}_{i},t\right)\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(n,r\right){v}_{n}\left(t\right){D}^{\alpha}\left({x}_{i}^{r}\right)+s\left({x}_{i},t\right)\\ +\text{\hspace{0.17em}}d\left({x}_{i},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\left({v}_{1}\left(t\right)w\left(1,r\right)+{v}_{p+1}\left(t\right)w\left(p+1,r\right)\right){D}^{\alpha}\left({x}_{i}^{r}\right);\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{for}\text{\hspace{0.17em}}i=2,3,\cdots ,p\end{array}$ (16)

where ${D}^{\alpha}\left({x}_{i}^{r}\right)$ denotes the value of ${D}^{\alpha}\left({x}^{r}\right)$ at ${x}_{i}$ .

Thus we have the following matrix equation

$A\left[\begin{array}{c}{{v}^{\prime}}_{2}\\ {{v}^{\prime}}_{3}\\ \vdots \\ {{v}^{\prime}}_{p}\end{array}\right]=B\left(t\right)\left[\begin{array}{c}{v}_{2}\\ {v}_{3}\\ \vdots \\ {v}_{p}\end{array}\right]+\left[\begin{array}{c}s\left({x}_{2},t\right)\\ s\left({x}_{3},t\right)\\ \vdots \\ s\left({x}_{p},t\right)\end{array}\right]+F\left(t\right)\left[\begin{array}{c}{v}_{1}\left(t\right)w\left(1,0\right)+{v}_{p+1}\left(t\right)w\left(p+1,0\right)\\ {v}_{1}\left(t\right)w\left(1,1\right)+{v}_{p+1}\left(t\right)w\left(p+1,1\right)\\ \vdots \\ {v}_{1}\left(t\right)w\left(1,p\right)+{v}_{p+1}\left(t\right)w\left(p+1,p\right)\end{array}\right]$

which in short we write as

$A{v}^{\prime}\left(t\right)=B\left(t\right)v\left(t\right)+s\left(t\right)+se\left(t\right)$ (17)

where

$A=\left[\begin{array}{ccc}{L}_{2}\left({x}_{2}\right)& {L}_{3}\left({x}_{2}\right)& \begin{array}{cc}\cdots & {L}_{p}\left({x}_{2}\right)\end{array}\\ {L}_{2}\left({x}_{3}\right)& {L}_{3}\left({x}_{3}\right)& \begin{array}{cc}\cdots & {L}_{p}\left({x}_{3}\right)\end{array}\\ \begin{array}{c}\vdots \\ {L}_{2}\left({x}_{p}\right)\end{array}& \begin{array}{c}\vdots \\ {L}_{3}\left({x}_{p}\right)\end{array}& \begin{array}{cc}\begin{array}{c}\ddots \\ \cdots \end{array}& \begin{array}{c}\vdots \\ {L}_{p}\left({x}_{p}\right)\end{array}\end{array}\end{array}\right]=\left[\begin{array}{ccc}1& 0& \begin{array}{cc}\cdots & 0\end{array}\\ 0& 1& \begin{array}{cc}\cdots & 0\end{array}\\ \begin{array}{c}\vdots \\ 0\end{array}& \begin{array}{c}\vdots \\ 0\end{array}& \begin{array}{cc}\begin{array}{c}\ddots \\ \cdots \end{array}& \begin{array}{c}\vdots \\ 1\end{array}\end{array}\end{array}\right]=I$

$B\left(t\right)=\left[\begin{array}{cccc}d\left({x}_{2},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(2,r\right){D}^{\alpha}\left({x}_{2}^{r}\right)& d\left({x}_{2},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(3,r\right){D}^{\alpha}\left({x}_{2}^{r}\right)& \cdots & d\left({x}_{2},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(p,r\right){D}^{\alpha}\left({x}_{2}^{r}\right)\\ d\left({x}_{3},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(2,r\right){D}^{\alpha}\left({x}_{3}^{r}\right)& d\left({x}_{3},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(3,r\right){D}^{\alpha}\left({x}_{3}^{r}\right)& \cdots & d\left({x}_{3},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(p,r\right){D}^{\alpha}\left({x}_{3}^{r}\right)\\ \vdots & \vdots & \ddots & \vdots \\ d\left({x}_{p},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(2,r\right){D}^{\alpha}\left({x}_{p}^{r}\right)& d\left({x}_{p},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(3,r\right){D}^{\alpha}\left({x}_{p}^{r}\right)& \cdots & d\left({x}_{p},t\right)\underset{r=0}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}w\left(p,r\right){D}^{\alpha}\left({x}_{p}^{r}\right)\end{array}\right]$

$F\left(t\right)=\left[\begin{array}{cccc}d\left({x}_{2},t\right){D}^{\alpha}\left({x}_{2}^{0}\right)& d\left({x}_{2},t\right){D}^{\alpha}\left({x}_{2}^{1}\right)& \cdots & d\left({x}_{2},t\right){D}^{\alpha}\left({x}_{2}^{p}\right)\\ d\left({x}_{3},t\right){D}^{\alpha}\left({x}_{3}^{0}\right)& d\left({x}_{3},t\right){D}^{\alpha}\left({x}_{2}^{1}\right)& \cdots & d\left({x}_{3},t\right){D}^{\alpha}\left({x}_{2}^{p}\right)\\ \vdots & \vdots & \ddots & \vdots \\ d\left({x}_{p},t\right){D}^{\alpha}\left({x}_{p}^{0}\right)& d\left({x}_{p},t\right){D}^{\alpha}\left({x}_{p}^{1}\right)& \cdots & d\left({x}_{p},t\right){D}^{\alpha}\left({x}_{p}^{p}\right)\end{array}\right]$

$v\left(t\right)=\left[\begin{array}{c}{v}_{2}\\ {v}_{3}\\ \begin{array}{c}:\\ {v}_{p}\end{array}\end{array}\right],\text{\hspace{0.17em}}\text{\hspace{0.17em}}{v}^{\prime}\left(t\right)=\left[\begin{array}{c}{{v}^{\prime}}_{2}\\ {{v}^{\prime}}_{3}\\ \begin{array}{c}:\\ {{v}^{\prime}}_{p}\end{array}\end{array}\right],\text{\hspace{0.17em}}\text{\hspace{0.17em}}s\left(t\right)=\left[\begin{array}{c}s\left({x}_{2},t\right)\\ s\left({x}_{3},t\right)\\ \begin{array}{c}:\\ s\left({x}_{p},t\right)\end{array}\end{array}\right]$

and

$se\left(t\right)=F\left(t\right)\cdot \left[\begin{array}{c}{v}_{1}\left(t\right)w\left(1,0\right)+{v}_{p+1}\left(t\right)w\left(p+1,0\right)\\ {v}_{1}\left(t\right)w\left(1,1\right)+{v}_{p+1}\left(t\right)w\left(p+1,1\right)\\ \begin{array}{c}\vdots \\ {v}_{1}\left(t\right)w\left(1,p\right)+{v}_{p+1}\left(t\right)w\left(p+1,p\right)\end{array}\end{array}\right]$

Since $A=I$ , Equation (17) immediately becomes

${v}^{\prime}\left(t\right)=B\left(t\right)v\left(t\right)+s\left(t\right)+se\left(t\right)$ (18)

Thus with the help of collocation method we reduce Equation (7) which was a fractional diffusion equation into Equation (18), a system of ODE.

Now by forcing Equation (15) to satisfy at each ${x}_{i};i=2,3,\cdots ,p$ we can write

$\underset{n=2}{\overset{p}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{v}_{n}\left(0\right){L}_{n}\left({x}_{i}\right)={u}^{0}\left({x}_{i}\right)-{v}_{1}\left(0\right){L}_{1}\left({x}_{i}\right)-{v}_{p+1}\left(0\right){L}_{p+1}\left({x}_{i}\right);i=2,3,\cdots ,p$

$\begin{array}{l}\Rightarrow {v}_{2}\left(0\right){L}_{2}\left({x}_{i}\right)+{v}_{3}\left(0\right){L}_{3}\left({x}_{i}\right)+\cdots +{v}_{p}\left(0\right){L}_{p}\left({x}_{i}\right)\\ ={u}^{0}\left({x}_{i}\right)-{v}_{1}\left(0\right){L}_{1}\left({x}_{i}\right)-{v}_{p+1}\left(0\right){L}_{p+1}\left({x}_{i}\right);\text{\hspace{0.17em}}i=2,3,\cdots ,p\end{array}$

$\Rightarrow \left[\begin{array}{ccc}{L}_{2}\left({x}_{2}\right)& {L}_{3}\left({x}_{2}\right)& \begin{array}{cc}\cdots & {L}_{p}\left({x}_{2}\right)\end{array}\\ {L}_{2}\left({x}_{3}\right)& {L}_{3}\left({x}_{3}\right)& \begin{array}{cc}\cdots & {L}_{p}\left({x}_{3}\right)\end{array}\\ \begin{array}{c}\vdots \\ {L}_{2}\left({x}_{p}\right)\end{array}& \begin{array}{c}\vdots \\ {L}_{3}\left({x}_{p}\right)\end{array}& \begin{array}{cc}\begin{array}{c}\ddots \\ \cdots \end{array}& \begin{array}{c}\vdots \\ {L}_{p}\left({x}_{p}\right)\end{array}\end{array}\end{array}\right]\left[\begin{array}{c}{v}_{2}\left(0\right)\\ {v}_{3}\left(0\right)\\ \begin{array}{c}\vdots \\ {v}_{p}\left(0\right)\end{array}\end{array}\right]=\left[\begin{array}{c}{u}^{0}\left({x}_{2}\right)\\ {u}^{0}\left({x}_{3}\right)\\ \begin{array}{c}\vdots \\ {u}^{0}\left({x}_{p}\right)\end{array}\end{array}\right]$

$\Rightarrow \left[\begin{array}{c}{v}_{2}\left(0\right)\\ {v}_{3}\left(0\right)\\ \begin{array}{c}\vdots \\ {v}_{p}\left(0\right)\end{array}\end{array}\right]=v\left(0\right)=\left[\begin{array}{c}{u}^{0}\left({x}_{2}\right)\\ {u}^{0}\left({x}_{3}\right)\\ \begin{array}{c}\vdots \\ {u}^{0}\left({x}_{p}\right)\end{array}\end{array}\right]$ (19)

Solution of Equation (18) will give us the unknowns ${v}_{n}\left(t\right);n=2,3,\cdots ,p$ in trial solution of Equation (7). Approximate solution of system of ordinary differential equation in Equation (18) with its initial condition in Equation (19) can be obtained by very well-known Euler’s method. Instead of continuous approximation to the solution $v\left(t\right)$ , approximations will be generated at mesh points

${t}_{j}>0$ . With step size $\Delta t=\frac{T}{{n}_{t}}>0;{n}_{t}\in \mathbb{N}$ , we define the mesh points as

${t}_{j}=j\Delta t;\text{\hspace{0.17em}}\text{\hspace{0.17em}}j=0,1,2,3,4,\cdots ,{n}_{t}$

Then Euler’s method becomes

$v\left({t}_{0}\right)=\left[\begin{array}{c}{u}^{0}\left({x}_{2}\right)\\ {u}^{0}\left({x}_{3}\right)\\ \begin{array}{c}\vdots \\ {u}^{0}\left({x}_{p}\right)\end{array}\end{array}\right]$

$v\left({t}_{j+1}\right)=\left[I+hB\left({t}_{j}\right)\right]v\left({t}_{j}\right)+hs\left({t}_{j}\right)+hse\left({t}_{j}\right);j=0,1,2,3,\cdots ,\left({n}_{t}-1\right)$ (20)

Equation (20) is the difference equation for the Euler’s method.

Finally substituting approximations of $v\left(t\right)$ at various mesh points ${t}_{j}$ into the trial solution at Equation (10) will produce the approximations of $u\left(x,t\right)$ at mesh points ${t}_{j}$ as ${u}_{p}\left(x,{t}_{j}\right)$ .

Error Calculation: Here we discuss only error calculation for the above method. Our main objective is to calculate local errors and global errors. At $t=T$ we define the absolute local error function as

$\epsilon \left(x\right)=\left|{u}_{p}\left(x,T\right)-u\left(x,T\right)\right|$

Then we define the global error at $t=T$ as

$\text{global\_error}=\underset{a}{\overset{b}{{\displaystyle \int}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\epsilon \left(x\right)\text{d}x$

In this study, we focus only on the numerical results and the resultant errors. Details of error analysis caused by different types of collocation points and Euler methods for system of ODE are left for further research.

4. Numerical Comparisons and Discussions

Now, we apply spectral collocation method discussed in the previous section with $p=5$ to solve fractional diffusion equation with four different sets of collocation points and will compare the results obtained. The four sets of collocation points are generated from Gauss-Lobatto nodes, roots of Chebyshev polynomials of first kind, roots of Legendre polynomials and equally spaced nodes over the space domain. The four sets of points are generated by the following way:

From Gauss-Labatto nodes, to generate the points on the interval $\left[a,b\right]$ we consider:

${x}_{k}=\frac{b-a}{2}+\frac{b-a}{2}\mathrm{cos}\frac{\left(k-1\right)\text{\pi}}{p};\text{\hspace{0.17em}}\text{\hspace{0.17em}}k=1,2,\cdots ,p+1$

Let ${y}_{k}$ be the roots of the Chebyshev polynomials of first kind ${T}_{p-1}\left(y\right)$ with ${y}_{k}<{y}_{k+1}$ for $k=1,2,\cdots ,p-2$ . Since roots of ${T}_{p-1}\left(y\right)$ are in the interval $\left(-1,1\right)$ we consider the following nodes along with ${x}_{1}=a$ and ${x}_{p+1}=b$

${x}_{k+1}=\frac{b-a}{2}+\frac{b-a}{2}{y}_{k};\text{\hspace{0.17em}}\text{\hspace{0.17em}}k=1,2,\cdots ,p-1$

Similarly, let ${w}_{k}$ be the roots of the Legendre polynomial ${P}_{p-1}\left(w\right)$ with ${w}_{k}<{w}_{k+1}$ for $k=1,2,\cdots ,p-2$ . Like Chebyshev polynomials, roots of ${P}_{p-1}\left(w\right)$ are in the interval $\left(-1,1\right)$ we consider the following nodes along with ${x}_{1}=a$ and ${x}_{p+1}=b$

${x}_{k+1}=\frac{b-a}{2}+\frac{b-a}{2}{w}_{k};\text{\hspace{0.17em}}\text{\hspace{0.17em}}k=1,2,\cdots ,p-1$

For equally spaced nodes over the space domain we consider the following points

${x}_{k}=a+\left(k-1\right)\frac{b-a}{p};\text{\hspace{0.17em}}\text{\hspace{0.17em}}k=1,2,\cdots ,p+1$

Now we will consider the performance of these four sets of collocation points into proposed spectral collocation scheme with two examples of space fractional diffusion equations. Since in both examples $a=0$ and $b=1$ , with $p=5$ the above four sets of points are calculated as follows:

$\begin{array}{l}\text{gauss\_lobatto}=\left\{0,0.0954915,0.345492,0.654508,0.904508,1\right\}\\ \text{chebyshev}=\left\{0,0.0380602,0.308658,0.691342,0.96194,1\right\}\\ \text{legendre}=\left\{0,0.0694318,0.330009,0.669991,0.930568,1\right\}\\ \text{equally\_spaced}=\left\{0,0.2,0.4,0.6,0.8,1\right\}\end{array}$

The exact solution of both examples can be verified by using Equation (2).

Example 1: We consider the following fractional diffusion equation used by Bahsi and Yalcinbas [7] :

$\frac{\partial u\left(x,t\right)}{\partial t}=d\left(x,t\right)\frac{{\partial}^{1.5}u\left(x,t\right)}{\partial {x}^{1.5}}+s\left(x,t\right);\text{\hspace{0.17em}}\text{\hspace{0.17em}}0<x<1,0\le t\le 2$

$u\left(x,0\right)=\left({x}^{2}+1\right)\mathrm{sin}1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}0<x<1$

$u\left(0,t\right)=\mathrm{sin}\left(t+1\right)\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u\left(1,t\right)=2\mathrm{sin}\left(t+1\right)$

where,

$d\left(x,t\right)=\Gamma \left(1.5\right){x}^{0.5}$

$s\left(x,t\right)=\left({x}^{2}+1\right)\mathrm{cos}\left(t+1\right)-2x\mathrm{sin}\left(t+1\right)$

The exact solution of Example 1 is $u\left(x,t\right)=\left({x}^{2}+1\right)\mathrm{sin}\left(t+1\right)$ .

Using proposed spectral collocation scheme, absolute local errors for the four different sets of collocation points along with exact solution at $T=2$ using $\Delta t=0.0025$ are given in Table 1.

The absolute local error curves for the four sets of points are given in Figure 1.

Four sets of collocation points give following global errors for Example 1:

$\begin{array}{l}{\text{global\_error}}_{\text{Gauss-Lobatto}}=0.0000360065\\ {\text{global\_error}}_{\text{Chebyshev}}=0.0000149475\\ {\text{global\_error}}_{\text{Legendre}}=0.0000312289\\ {\text{global\_error}}_{\text{Equally\_spaced}}=0.0000407057\end{array}$

Example 2: We consider the following fractional diffusion equation used by Huang and Zheng [9] :

$\frac{\partial u\left(x,t\right)}{\partial t}=d\left(x,t\right)\frac{{\partial}^{1.2}u\left(x,t\right)}{\partial {x}^{1.2}}+s\left(x,t\right);\text{\hspace{0.17em}}\text{\hspace{0.17em}}0<x<1,\text{\hspace{0.17em}}0\le t\le 2$

Table 1. Absolute local error at $T=2$ .

Figure 1. Absolute local error curve at $T=2$ .

$u\left(x,0\right)={x}^{2},\text{\hspace{0.17em}}\text{\hspace{0.17em}}0<x<1$

$u\left(0,t\right)=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u\left(1,t\right)={\text{e}}^{-t}$

where,

$d\left(x,t\right)=\frac{\Gamma \left(1.8\right){x}^{2.2}}{2}$

$s\left(x,t\right)={x}^{2}\left(x+1\right){\text{e}}^{-t}$

The exact solution of Example 2 is $u\left(x,t\right)={x}^{2}{\text{e}}^{-t}$ .

Using proposed spectral collocation scheme absolute local errors for the four different sets of collocation points along with exact solution at $T=2$ using $\Delta t=0.0025$ are given in Table 2.

The absolute local error curves for the four sets of points are given in Figure 2.

Four sets of collocation points gives following global errors for Example 2:

$\begin{array}{l}{\text{global\_error}}_{\text{Gauss-Lobatto}}=0.000129786\\ {\text{global\_error}}_{\text{Chebyshev}}=0.000139473\\ {\text{global\_error}}_{\text{Legendre}}=0.000137378\\ {\text{global\_error}}_{\text{Equally\_spaced}}=0.000202811\end{array}$

From absolute local error curves and global errors of both examples we can say that spectral collocation method based on Lagrange’s basis polynomials give very satisfactory approximations to the solution of space fractional diffusion equation. Though we used lower order and very simple Euler’s method to solve resultant system of ODE but yet get very satisfactory approximations. The accuracy can be improved by using higher order method than Euler’s method to solve system of ODE. About performance of different collocation points it is evident that there is no way to declare which one is better since there are variations among absolute local errors over the space domain for different sets of

Table 2. Absolute local error at $T=2$ .

Figure 2. Absolute local error curve at $T=2$ .

points. Even if we consider global error, performance of different sets of collocation points vary from one problem to another. We observe another intriguing feature, that is, in case of Example 1 errors due to Chebyshev nodes and in case of Example 2 errors due to equally spaced nodes fluctuates over the domain where other nodes does not show such fluctuations.

5. Conclusion

There are several spectral collocation methods available for different types of partial fractional differential equations. We discussed spectral collocation method based on Lagrange’s basis polynomials for 1D space fractional diffusion equation where our proposed form of trial solution can handle non-zero Dirichlet’s boundary conditions on both boundaries effectively. Properties of Lagrange’s basis polynomials reduce the volume of the calculations needed and result simpler equations. We implemented the method into two examples with four different sets of collocation points and found excellent match with exact solution in each case. We compared absolute local errors and global errors for each set of points. No clear conclusion can be drawn about which set of points give better approximations for space fractional diffusion equation in spectral collocation method which we discussed here.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] |
Ray, S.S. (2009) Analytical Solution for the Space Fractional Diffusion Equation by Two-Step Adomain Decomposition Method. Communications in Nonlinear Science and Numerical Simulation, 14, 1295-1306. https://doi.org/10.1016/j.cnsns.2008.01.010 |

[2] |
Khader, M.M. (2011) On the Numerical Solutions for the Fractional Diffusion Equation. Communications in Nonlinear Science and Numerical Simulation, 16, 2535-2542. https://doi.org/10.1016/j.cnsns.2010.09.007 |

[3] | Azizi, H. and Loghmani, G.B. (2013) Numerical Approximation for Space Fractional Diffusion Equation Chebyshev Finite Difference Method. Journal of Fractional Calculus and Applications, 4, 303-311. |

[4] |
Xie, J., Huang, Q. and Yang, X. (2016) Numerical Solution of the One-Dimensional Fractional Convection Diffusion Equations Based on Chebyshev Operational Matrix. Springer Plus, 5, 1149. https://doi.org/10.1186/s40064-016-2832-y |

[5] |
Bhrawy, A.H. (2014) A New Legendre Collocation Method for Solving a Two-Dimensional Fractional Diffusion Equation. Abstract and Applied Analysis, Article ID: 636191. https://doi.org/10.1155/2014/636191 |

[6] |
Lin, Y. and Xu, C. (2007) Finite Difference/Spectral Approximations for the Time-Fractional Diffusion Equation. Journal of Computational Physics, 225, 1533-1552. https://doi.org/10.1016/j.jcp.2007.02.001 |

[7] |
Bahsi, A.K. and Yalcinbas, S. (2016) Numerical Solution and Error Estimations for the Space Fractional Diffusion Equation with Variable Coefficients via Fibonacci Collocation Method. Springer Plus, 5, 1375. https://doi.org/10.1186/s40064-016-2853-6 |

[8] |
Pirim, N.A. and Ayaz, F. (2016) A New Technique for Solving Fractional Order Systems: Hermite Collocation Method. Applied Mathematics, 7, 2307-2323. https://doi.org/10.4236/am.2016.718182 |

[9] |
Huang, Y. and Zheng, M. (2013) Pseudo-Spectral Method for Space Fractional Diffusion Equation. Applied Mathematics, 4, 1495-1502. https://doi.org/10.4236/am.2013.411202 |

[10] |
Huang, F. (2012) A Time-Space Collocation Spectral Approximation for a Class of Time Fractional Differential Equations. International Journal of Differential Equations, Article ID: 495202. https://doi.org/10.1155/2012/495202 |

Journals Menu

Contact us

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2022 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.