ABSTRACT

This research paper represents a numerical approximation to non-linear two-dimensional reaction diffusion equation from population genetics. Since various initial and boundary value problems exist in two-dimensional reaction-diffusion, phenomena are studied numerically by different numerical methods, here we use finite difference schemes to approximate the solution. Accuracy is studied in term of $L_2$ , $L_{\infty }$ and relative error norms by random selected grids along time levels for comparison with exact results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. It is shown that the numerical schemes give better solutions. Moreover, the schemes can be easily applied to a wide class of higher dimension nonlinear reaction diffusion equations with a little modification.

Keywords:

Forward in Time and Centre in Space (FTCS), Taylor’s Series, Crank Nicolson, Alternating Direction Implicit (ADI) Scheme

1. Introduction

Let us consider a population distributed in a linear habitat, such as shore line, which occupies with a uniform quantity of density [1] . If at any point of the habitat, a mutation occurs, which happens to be in some degree, however, slight, advantageous to survival, in the totality of its effects [1] [2] . We may expect the mutant gene to increase at the expense of all allelomorph or allelomorphs previously occupying the same set of points [2] [3] . This process will be first computed in the neighbourhood of the occurrence of the mutation and later, as the advantageous gene is diffused into the surrounding population, in the adjacent portions of its range [3] . Supposing that this range to be long compared with the distances separately, the sites of offspring from these of their parents, there will be advancing from origin, a wave of increase in the gene frequency [4] . Let us consider the following possible postulates of above phenomena.

Let $p$ be the frequency of the mutant gene, and $q$ is its parent allelomorph and we suppose, it is only the allelomorph parent [4] [5] . Let $m$ be the intensity of the selection in favour of the mutant gene, supposing independence of $p$ . Let us suppose that the rate of diffusion per generation across any boundary may be equated to $-k{\partial }_{x}p$ at that boundary, $x$ being the coordinate measuring position in the linear habitat [5] . Then $p$ must satisfy the differential equation,

$p_t=k{p}_{xx}+mpq$ (1)

where $t$ represents time in generation, where constant $k$ is coefficient of diffusion analogous which is used in physics.

2. Governing Equation

Many complicated natural phenomena, such as the spreading of bushfire and epidemics, and the non-linear evolution of a population in a two dimensional habitat [6] [7] [8] [9] , (in which the balance of reaction and diffusion are concerned) can be modelled by a two dimensional reaction-diffusion equation

$\begin{array}{r}\hfill u_t=\beta \left(u_{xx}+u_{yy}\right)+\alpha f\left(u\right)\\ \hfill u_t=\nabla \cdot \left(\beta \nabla u\right)+\alpha f\left(u\right)\end{array}\}$ (2)

where $u$ is a dimensionless temperature or population density, $u_t$ is the rate of increase of $u$ with time $t$ , $\nabla$ is the gradient operator in two dimensional space, $\beta$ is a constant second order tensor measuring the diffusivity of the media, and $f\left(u\right)$ is a non-linear function of $u$ representing the effect of reaction or multiplication. Also $\mu$ represents reactive constant after diffusion occurs. Assuming ${\beta }_1$ and ${\beta }_2$ are the principal values of $\beta$ as in Equation (2) and x and y are coordinates along the principle axes, Equation (2) can be written as

$u_t={\beta }_1{u}_{xx}+{\beta }_2{u}_{yy}+\alpha u\left(1-u\right)$ (3)

3. Exact Solution

To derive the exact solution of the given system in Equation (3), we assume the exact solution of the two dimensional non-linear reaction diffusion equation is [10] [11] [12] [13] ,

$\begin{array}{r}\hfill u\left(x,y,t\right)=20+80\left(y-e^{Dt}\sin \left(\frac{x\text{π}}{2}\right)\sin \left(\frac{y\text{π}}{2}\right)\right)\\ \hfill \text{Where}D=-\frac{\beta {\text{π}}^2}{2}\end{array}\}$ (4)

4. Numerical Methods

We consider the numerical solution of the non-linear Equation (3) in a finite domain $\Omega =\left\{\left(x,y\right)|a<x<b,c<y<d\right\}$ . The first step is to choose integers n and m to define step sizes $h=\left(b-a\right)/n$ and $k=\left(d-c\right)/m$ in x and y di- rections respectively. Partition the interval [a, b] into n equal parts of width h and the interval [c, d] into m equal parts of width k. Place a grid on the rectangle R by drawing vertical and horizontal lines through the points with coordinates $\left(x_i\mathrm{,}{y}_j\right)$ , where $x_i=a+ih$ for each $i=0,1,2,\cdots n$ and $y_j=c+jk$ for each $j=0,1,2,\cdots m$ also the lines $x=x_i$ and $y=y_j$ are grid lines, and their intersections are the mesh points of the grid. For each mesh point in the interior of the grid, $\left(x_i\mathrm{,}{y}_j\right)$ , for $i=1,2,\cdots ,n-1$ and $j=1,2,\cdots ,m-1$ , we apply dif- ferent algorithms to approximate the numerical solution to the problem in Equation (3) also we assume $t_N=Nt,N=0,1,\cdots ,$ where t is the time.

4.1. Second Order Implicit Scheme

We apply Crank Nicolson implicit finite difference scheme to Equation (3),

$\begin{array}{l}{\delta }_x^2\widehat{u}=\frac{{\widehat{u}}_{l+1,m}-2{\widehat{u}}_{l,m}+{\widehat{u}}_{l-1,m}}{h^2}\hfill \\ {\delta }_y^2\widehat{u}=\frac{{\widehat{u}}_{l,m+1}-2{\widehat{u}}_{l,m}+{\widehat{u}}_{l,m-1}}{h^2}\hfill \\ {\delta }_x^2\widehat{v}=\frac{{\widehat{v}}_{l+1,m}-2{\widehat{v}}_{l,m}+{\widehat{v}}_{l-1,m}}{h^2}\hfill \\ {\delta }_y^2\widehat{v}=\frac{{\widehat{v}}_{l,m+1}-2{\widehat{v}}_{l,m}+{\widehat{v}}_{l,m-1}}{h^2}\hfill \end{array}\}$

$\begin{array}{r}\hfill \begin{array}{c}{u}_{i\mathrm{,}j}^{n+1}=u_{i\mathrm{,}j}^n+\frac{k{\beta }_1}{2h_x^2}{\delta }_x^2\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)+\frac{k{\beta }_2}{2h_y^2}{\delta }_y^2\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\\ +\frac{k\mu }{2}\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\left(1-\frac{1}{2}\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\right)\end{array}\\ \hfill \text{Where}{R}_1=\frac{k{\beta }_1}{2h_x^2},R_2=\frac{k{\beta }_2}{2h_y^2}\text{and}{Q}_1=\frac{k\mu }{2}\\ \hfill \begin{array}{c}{u}_{i\mathrm{,}j}^{n+1}=u_{i\mathrm{,}j}^n+R_1{\delta }_x^2\left(u_{i,j}^{n+1}+u_{i,j}^n\right)+R_2{\delta }_y^2\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\\ +Q_1\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\left(1-\frac{1}{2}\left(u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j}^n\right)\right)\end{array}\end{array}\}$ (5)

4.2. Computationally Efficient Implicit Scheme

In search of a time efficient alternate, we analysed the naive version of the Crank-Nicolson scheme for the two dimensional equation, and find out that scheme is not time efficient [14] [15] [16] [17] [18] . To get high time efficiency, the common name of Alternating Direction Implicit (ADI) method, can be used. The derivation to ADI scheme, we have following steps;

ADI formulation: Peaceman-Rachford algorithm:

Introduce an FTCS scheme for the first time step $\star =n+\frac{1}{2}$ , of the form

$\begin{array}{l}\begin{array}{r}\hfill \begin{array}{l}\frac{u_{i,j}^{\star }-u_{i,j}^n}{\Delta t/2}-\frac{{\beta }_1}{h_x^2}\left(u_{i-1,j}^{\star }-2u_{i,j}^{\star }+u_{i+1,j}^{\star }\right)\\ -\frac{{\beta }_2}{h_y^2}\left(u_{i,j-1}^n-2u_{i,j}^n+u_{i,j+1}^n\right)=\mu f\left(u_{i,j}^n\right)\end{array}\\ \hfill \text{inthecompactform,aboveequationcanbeseenas:}\\ \hfill \frac{u_{i,j}^{\star }-u_{i,j}^n}{\Delta t/2}-S_1{L}_{xx}{u}_{i,j}^{\star }-S_2{L}_{yy}{u}_{i,j}^n=\mu f\left(u_{i,j}^n\right)\\ \hfill \begin{array}{l}\text{aboveequationcanbewrittenasinalgorithm}\\ \text{form,for}i=1,2,3,\cdots ,n-1\end{array}\end{array}\}\hfill \\ \begin{array}{r}\hfill \begin{array}{l}-\frac{1}{2}{R}_1{u}_{i-\mathrm{1,}j}^{\star }+\left(1+R_1\right)u_{i\mathrm{,}j}^{\star }-\frac{1}{2}{R}_1{u}_{i+\mathrm{1,}j}^{\star }\\ =\frac{1}{2}{R}_2{u}_{i\mathrm{,}j-1}^n+\left(1-R_2\right)u_{i\mathrm{,}j}^n+\frac{1}{2}{R}_2{u}_{i\mathrm{,}j+1}^n+\frac{\mu \Delta t}{2}f\left(u_{i\mathrm{,}j}^n\right)\end{array}\\ \hfill \text{abovealgorithmvalidatesitsresultsfor}i=1,2,3,\cdots ,n-1\end{array}\}\hfill \end{array}\}$ (6)

Now let us consider the second time step,

$\begin{array}{l}\begin{array}{r}\hfill \begin{array}{l}\frac{u_{i\mathrm{,}j}^{n+1}-u_{i\mathrm{,}j}^{\star }}{\Delta t/2}-\frac{{\beta }_1}{h_x^2}\left(u_{i-\mathrm{1,}j}^{\star }-2u_{i\mathrm{,}j}^{\star }+u_{i+\mathrm{1,}j}^{\star }\right)\\ -\frac{{\beta }_2}{h_y^2}\left(u_{i\mathrm{,}j-1}^{n+1}-2u_{i\mathrm{,}j}^{n+1}+u_{i\mathrm{,}j+1}^{n+1}\right)=\mu f\left(u_{i\mathrm{,}j}^{\star }\right)\end{array}\\ \hfill \text{inthecompactform,aboveequationcanbeseenas:}\\ \hfill \frac{u_{i\mathrm{,}j}^{n+1}-u_{i\mathrm{,}j}^{\star }}{\Delta t/2}-S_1{L}_{xx}{u}_{i\mathrm{,}j}^{\star }-S_2{L}_{yy}{u}_{i\mathrm{,}j}^{n+1}=\mu f\left(u_{i\mathrm{,}j}^{\star }\right)\\ \hfill \begin{array}{l}\text{aboveequationcanbewrittenasin}\\ \text{algorithmform,for}j=1,2,3,\cdots ,m-1\end{array}\end{array}\}\hfill \\ \begin{array}{r}\hfill \begin{array}{l}-\frac{1}{2}{R}_2{u}_{i-\mathrm{1,}j}^{n+1}+\left(1+R_2\right)u_{i\mathrm{,}j}^{n+1}-\frac{1}{2}{R}_2{u}_{i+\mathrm{1,}j}^{n+1}\\ =\frac{1}{2}{R}_1{u}_{i-\mathrm{1,}j}^{\star }+\left(1-R_1\right)u_{i\mathrm{,}j}^{\star }+\frac{1}{2}{R}_1{u}_{i+\mathrm{1,}j}^{\star }+\frac{\mu \Delta t}{2}f\left(u_{i\mathrm{,}j}^{\star }\right)\end{array}\\ \hfill \text{abovealgorithmvalidatesitsresultsfor}j=1,2,3,\cdots ,m-1\end{array}\}\hfill \end{array}\}$ (7)

The trick used in constructing the ADI scheme is to split time step into two, and apply two different stencils in each half time step, therefore to increment time by one time step in grid point , we first compute both of these stencils are chosen such that the resulting linear system is block tridiagonal [19] [20] [21] [22] . To obtain the numerical solution, we need to solve a block non-linear tridiagonal system at each time step. We have done this by using Newton’s iterative method.

Algorithm 1:

The non-linear system in Equations (6) and (7), can be written in the form:

$R\left(W\right)=0$ (8)

where $R={\left(r_1,r_2,r_3,\cdots ,r_{2n}\right)}^t,W=\left(u_1^{n+1},v_1^{n+1},u_2^{n+1},v_2^{n+1},\cdots ,u_m^{n+1},v_m^{n+1}\right)$ and $r_1\mathrm{,}{r}_2\mathrm{,}{r}_3\mathrm{,}\cdots ,r_{2n}$ are the non-linear equations obtained from the system (6 and 7). The system of equations, is solved by Newton’s iterative method using the following steps

1) Specify $W^{\left(0\right)}$ as an initial approximation.

2) For $k=0,1,2,\cdots \mathrm{.}$ until convergence achieve.

・ Solve the linear system $A\left(W^{\left(k\right)}\right)\Delta W^{\left(k\right)}=-R\left(W^{\left(k\right)}\right),$

・ Specify $W^{\left(k+1\right)}=W^{\left(k\right)}+\Delta W^{\left(k\right)}$ ,

where $A\left(W^{\left(k\right)}\right)$ is $\left(m\times m\right)$ Jacobian matrix, which is computed analytically and $\Delta W^{\left(k\right)}$ is the correction vector. In the iteration method solution at the previous time step is taken as the initial guess. Iteration at each time step is stopped when ${\Vert R\left(W^{\left(k\right)}\right)\Vert }_{\infty }\le Tol$ with Tol is a very small prescribed value. The linear system obtained from Newton’s iterative method, is solved by Crout’s method. Convergence done with iterations along less CPU time [23] .

Algorithm 2:

Clearly, the system is tridiagonal and can be solved with Thomas algorithm. The dimension of J is $n\times m$ . In general a tridiagonal system can be written as,

$a_i{x}_{i-1}+b_i{x}_i+c_i{x}_{i+1}=S_i,\text{with}{a}_1=c_n=0$

above system can be written as in a matrix-vector form,

$Ju=S$

where $J$ is a coefficient matrix (Jacobean Matrix), which is known, comes from Newton’s iterative method. Right hand side is column vector which is known. Our main goal is to find the resultant vector $u$ . Now we have

$J=\left[\begin{array}{cccccc}{b}_1& c_1& 0& 0& 0& \cdots 0\\ a_2& b_2& c_2& 0& 0& \cdots 0\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ \cdots & \cdots & \cdots & a_{n-1}& b_{n-1}& c_{n-1}\\ \cdots & \cdots & \cdots & \cdots & a_n& b_n\end{array}\right]$

$\underset{\_}{u}={\left[u_1,u_2,u_3,\cdots ,u_n\right]}^t$

$\underset{\_}{S}={\left[s_1,s_2,s_3,\cdots ,s_n\right]}^t$

technique is explained in the following steps,

$J=LU$

where

$L=\left[\begin{array}{cccccc}{\mu }_1& 0& 0& 0& 0& \mathrm{...0}\\ {\beta }_2& {\mu }_2& 0& 0& 0& \mathrm{...0}\\ {\alpha }_3& {\beta }_3& {\mu }_3& 0& 0& \mathrm{...0}\\ \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...0}\\ \mathrm{...}& \mathrm{...}& {\alpha }_{n-1}& {\beta }_{n-1}& {\mu }_{n-1}& 0\\ \mathrm{...}& \mathrm{...}& \mathrm{...}& {\alpha }_n& {\beta }_n& {\mu }_n\end{array}\right]$

And

$U=\left[\begin{array}{cccccc}1& {\delta }_1& {\lambda }_1& 0& 0& \mathrm{...0}\\ 0& 1& {\delta }_2& {\lambda }_2& 0& \mathrm{...0}\\ 0& 0& 1& {\delta }_3& {\lambda }_3& \mathrm{...0}\\ \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...0}\\ \mathrm{...}& \mathrm{...}& 0& 1& {\delta }_{n-2}& {\lambda }_2\\ \mathrm{...}& \mathrm{...}& 0& 0& 1& {\delta }_{n-1}\\ \mathrm{...}& \mathrm{...}& \mathrm{...}& 0& 0& 1\end{array}\right]$

By equating both sides of the $Ju=S$ , we get the elements of the matrices $L$ and $U$ . The computational tricks for the implementation of Thomas algorithm are shown in results, taken from a specific examples.

5. Error Norms

The accuracy and consistency of the schemes is measured in terms of error norms specially $L_2$ and $L_{\infty }$ [23] [24] [25] [26] which are defined as:

$\begin{array}{r}{L}_{\infty }={\Vert u^{\text{ecact}}-u^{\text{Approximation}}\Vert }_{\infty }=\underset{1\le i\le m}{{\displaystyle \max }}{\displaystyle \sum _{j=1}^m}\left|u_j^{\text{ecact}}-u_j^{\text{Approximation}}\right|\\ L_2={\Vert u^{\text{ecact}}-u^{\text{Approximation}}\Vert }_2=\sqrt{{\displaystyle \sum _{j=1}^m}\left|u_j^{\text{ecact}}-u_j^{\text{Approximation}}\right|}\\ {\text{Error}}_{\text{relative}}=\sqrt{\frac{{\displaystyle \sum _i}{\displaystyle \sum _j}{\left|u_{i,j}^{\text{ecact}}-u_{i,j}^{\text{Approximation}}\right|}^2}{{\displaystyle \sum _j}{\left|u_{i,j}^{\text{exact}}\right|}^2}}\\ \text{Rate}=\frac{\log \left({\text{Error}}_h/{\text{Error}}_{h/2}\right)}{\log \left(h/\left(h/2\right)\right)}\end{array}\}$ (9)

6. Results

Numerical computations have been performed using the uniform grid. Table 1 & Table 2 represent results at different grids and time level using Crank Nicolson implicit scheme. We fixed some parameters such as time step $k=0.0001,$ ${\beta }_1={\beta }_2=1$ and ${\beta }_1={\beta }_2=1/4$ . Scheme convergence viewed through $L_2$ , $L_{\infty }$ , relative error norms [27] [28] [29] [30] . Table 3 & Table 4 represent results at different grids and time level using ADI implicit scheme, keeping fixed parameters as we did before. In Table 5, we get results using ADI

scheme at very small step spacing to understand the importance of reducing steps. Rate of convergence can be seen from Table 6, which explains two implicit schemes. Figure 1 & Figure 2 show results for CN for different times and grids respectively. Figure 3 & Figure 4 show results for ADI for different times and grids respectively. Figure 5 gives comparison of two implicit schemes for reducing step spacing in x and y directions respectively. Last Figure 6 shows interesting results for different times. Sharp edges remove during increasing

time level [31] [32] [33] [34] . These results are very interesting for us to understand the efficency of the later scheme.

Cite this paper

Hasnain, S., Saqib, M. and Mashat, D.S. (2017) Two-Dimen- sional Nonlinear Reaction Diffusion Equation with Time Efficient Scheme. American Journal of Computational Mathematics, 7, 183-194. https://doi.org/10.4236/ajcm.2017.72017

References