Computational Solutions of Two Dimensional Convection Diffusion Equation Using Crank-Nicolson and Time Efficient ADI ()

Muhammad Saqib^{}, Shahid Hasnain^{}, Daoud Suleiman Mashat^{}

Department of Mathematics, Numerical Analysis, King Abdulaziz University, Jeddah, Saudi Arabia.

**DOI: **10.4236/ajcm.2017.73019
PDF
HTML XML
1,997
Downloads
5,971
Views
Citations

Department of Mathematics, Numerical Analysis, King Abdulaziz University, Jeddah, Saudi Arabia.

To develop an efficient numerical scheme for
two-dimensional convection diffusion equation using Crank-Nicholson and ADI, time-dependent
nonlinear system is discussed. These schemes are of second order accurate in
apace and time solved at each time level. The procedure was combined with
Iterative methods to solve non-linear systems. Efficiency and accuracy are
studied in term of *L _{2}*,

Keywords

Crank-Nicholson, Taylor’s Series, Newton’s Iterative Method, Alternating Direction Implicit (ADI)

Share and Cite:

Saqib, M. , Hasnain, S. and Mashat, D. (2017) Computational Solutions of Two Dimensional Convection Diffusion Equation Using Crank-Nicolson and Time Efficient ADI. *American Journal of Computational Mathematics*, **7**, 208-227. doi: 10.4236/ajcm.2017.73019.

1. Introduction

In this paper we have extended our previous approach associated to two dimension Convection-diffusion equation. The great Physicist Johannes Martinus Burgers discovered Burgers equation, which is non-linear parabolic partial dif- ferential equation (PDE) and widely used as a model in many engineering problems, which explains such as physical flow phenomena in fluid dynamics, turbulence, boundary layer behavior, shock wave formation, and mass transport [1] . Two dimensional convection-diffusion equation is given by the following equation.

${u}_{t}+u{u}_{x}+u{u}_{y}-\frac{1}{R}\left({u}_{xx}+{u}_{yy}\right)=0$ (1)

where $\left(x\mathrm{,}y\mathrm{,}t\right)\in \Omega \times \left(0,T\right]$

with initial conditions

$u\left(x,y,0\right)={u}_{0}\left(x,y\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left(x,y\right)\in \Omega $

The Dirichlet boundary conditions are given by

$u\left(a,y,t\right)={f}_{1}\left(x,y,t\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u\left(b,y,t\right)={f}_{2}\left(x,y,t\right)$

$u\left(x,c,t\right)={g}_{1}\left(x,y,t\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u\left(x,d,t\right)={g}_{2}\left(x,y,t\right)$

where $\left(x\mathrm{,}y\mathrm{,}t\right)\in \Omega \times \left(0,T\right]$ , $\Omega =\left\{\left(x,y\right):a\le x\le b,c\le y\le d\right\}$ is a rectangular domain in ${R}^{2}$ , $\left(0,T\right]$ is the time interval. ${u}_{0}\mathrm{,}{f}_{1}\mathrm{,}{f}_{2},{g}_{1}\mathrm{,}{g}_{2}$ are given sufficiently smooth functions and $u\left(x\mathrm{,}y\mathrm{,}t\right)$ may represent heat, diffusion, etc. Re is the Reynolds number.

This equation established the interaction between the non-linear convection processes and the diffusive viscous processes [2] . As Burgers equation is probably one of the simplest non-linear PDE for which it is possible to obtain an exact solution [3] . Also depending on the magnitude of the various terms in Burgers equation, it behaves as an elliptic, parabolic or hyperbolic PDE, conse- quently, it is one of the principle model equations used to test the accuracy of new numerical methods or computational algorithms [4] . It is widely known that non-linear PDEs do not have precise analytic solutions [5] . The first attempt to solve the Burgers equation analytically was done by Batman [6] , who derived the steady state solution of this equation as a test solution to one dimension, which was used to model turbulence nature of the phenomena [7] [8] . The two dimensional non-linear Burgers equations are a special form of in compressible Naiver-Stokes equations without the pressure term and the continuity equation [9] [10] . Due to its wide range of applicability, several researchers, both scientists and engineers, have been interested in studying the properties of the Burgers equation using various numerical techniques [11] . They have successfully used it to develop new computational algorithms and to test the existing ones [12] . Vineet and Tamsir [10] used two different test problems to analyses the accuracy of the Crank Nicholson(CN) scheme [10] . From literature review, it came to know that Newton’s method is also applicable to reform the Jacobean matrix to get the linear algebraic sparse matrix. Solution of such algebraic system of equations can be found by Gauss elimination with partial pivoting technique [13] [14] . Bahadir also used same technique to test the accuracy of scheme, using fully implicit finite difference scheme [15] [16] . The terminology of the Burgers equation explains that with viscous term the Burgers Equation is parabolic while without viscous term it is hyperbolic. In the later case it possesses discontinuous solutions due to the non-linear term and even if smooth initial condition is considered the solution may be discontinuous after finite time [8] . It also governs the phenomenon of shock waves [12] .

Many different researchers used Burgers equation to develop new algorithms and to test various existing algorithms [4] . For exact solution of such non-linear problem, researchers used Hopf-Cole transformation to linearize the Burgers equations into parabolic partial differential equation [17] . Some of the resear- chers also tried to tackle the non-linear Burgers equation directly (without Hopf-Cole transformation), by applying Crank-Nicholson finite difference method to the linearized Burgers equation by Hopf-Cole transformation which is unconditionally stable and is second order convergent, in both space and time with no restriction on mesh size [10] . In another result due to Kutluay et al. a direct approach via least square quadratic B-spline finite element method is discussed [18] . Recently Pandey et al. discussed Douglas finite difference scheme on linearized Burgers equation which is fourth order convergent in space and second order convergent in time [1] [18] .

1.1. Problem 1

From literature review, [19] we found that earlier work done by Mittal,Jain and Holla in 2012 [20] on convection-diffusion equation in one dimension. We extended our work to enhance our knowledge towards two dimensional Convection diffusion equation.Two test problems were taken to understand the numerical solution with finite difference schemes. By setting some parameters with arbitrary constants in bounded domain $\Omega =\left\{\left(x,y\right):-0.5\le x\le 0.5,-0.5\le y\le 0.5\right\}$ . Exact solution of the above two dimensional equation is

$u\left(x,y,t\right)=0.5-\mathrm{tanh}\left(\frac{\left(x+y-t\right)R}{2}\right)$ (2)

where $\left(x\mathrm{,}y\right)\in \Omega $ , $t>0$ and R is a parameter, known as Reynolds number. Boundary conditions and initial conditions can be taken from exact solution of u(x,y,t) [21] .

1.2. Problem 2

In this problem the rectangular domain of two dimensional nonlinear convection- diffusion Equation (1) is given as $\Omega =\left[\left(x\mathrm{,}y\right)\mathrm{:0}\le x\le \mathrm{1,0}\le y\le 1\right]$ . Exact solution of the above two dimensional equation is

$u\left(x,y,t\right)=\frac{1}{1+\frac{\left(x+y-t\right)R}{2}}$ (3)

where $\left(x\mathrm{,}y\right)\in \Omega $ , $t>0$ and R is a parameter, known as Reynolds number. Boundary conditions and initial conditions can be taken from exact solution of $u\left(x,y,t\right)$ . where $\Omega $ is a rectangular domain in ${R}^{2}$ . The main objective of the paper is to find efficient solution of unknown $u\left(x\mathrm{,}t\right)$ . Two test problems were described to understand the numerical solution by taking two finite difference schemes. Also Convection diffusion equation has been extensively studied to describe various kinds of phenomena which can be seen from equation [21] .

2. Numerical Methods

Numerical solution of the two dimensional non-linear equation in a finite domain $\Omega $ . The first step is to choose integers L and M to define step sizes $hx=\left(b-a\right)/L$ and $hy=\left(d-c\right)/M$ in x and y directions respectively. Partition the interval [a, b] into L equal parts of width ${h}_{x}$ and the interval [c, d] into M equal parts of width ${h}_{y}$ . Place a grid by drawing vertical and horizontal lines through the points with coordinates $\left({x}_{l}\mathrm{,}{y}_{m}\right)$ , where ${x}_{l}=a+lh$ for each $l=0,1,2,\cdots ,L$ and ${y}_{m}=c+mk$ for each $m=0,1,2,\cdots ,M$ also the lines $x={x}_{l}$ and $y={y}_{m}$ 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}_{l}\mathrm{,}{y}_{m}\right)$ , for $l=1,2,\cdots ,L-1$ and $m=1,2,\cdots ,M-1$ , we apply different algorithms to approximate the numerical solution to the problem in equation [21] also we assume ${t}_{n}=nk,n=0,1,\cdots ,NT$ where t is the time.

2.1. Second Order Implicit Scheme

We apply Crank-Nicholson implicit finite difference scheme to equation [21] , by integrating Equation (1) in the compact way:

$\begin{array}{l}{u}_{t}=\frac{{u}_{l,m}^{n+1}+{u}_{l,m}^{n}}{k},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}u=\frac{{u}_{l,m}^{n+1}+{u}_{l,m}^{n}}{2}\\ {u}_{x}=\frac{{u}_{l+1,m}^{n+1}-{u}_{l-1,m}^{n+1}+{u}_{l+1,m}^{n}-{u}_{l-1,m}^{n}}{4h},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}{u}_{y}=\frac{{u}_{l,m+1}^{n+1}-{u}_{l,m-1}^{n+1}+{u}_{l,m+1}^{n}-{u}_{l,m-1}^{n}}{4h}\\ {\delta}_{x}^{2}\stackrel{^}{u}=\frac{{\stackrel{^}{u}}_{l+1,m}-2{\stackrel{^}{u}}_{l,m}+{\stackrel{^}{u}}_{l-1,m}}{{h}^{2}},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}{\delta}_{y}^{2}\stackrel{^}{u}=\frac{{\stackrel{^}{u}}_{l,m+1}-2{\stackrel{^}{u}}_{l,m}+{\stackrel{^}{u}}_{l,m-1}}{{h}^{2}}\end{array}\}$

when substitute these terms in to Equation (1), the Crank-Nicholson Scheme is given by

$\begin{array}{l}{u}_{l,m}^{n+1}-{u}_{l,m}^{n}+{R}_{1}[\left({u}_{l,m}^{n+1}+{u}_{l,m}^{n}\right)\{{u}_{l+1,m}^{n+1}-{u}_{l-1,m}^{n+1}+{u}_{l+1,m}^{n}-{u}_{l-1,m}^{n}+{u}_{l,m+1}^{n+1}-{u}_{l,m-1}^{n+1}\end{array}$ $+{u}_{l,m+1}^{n}-{u}_{l,m-1}^{n}\left\}\right]+{R}_{2}[{u}_{l+1,m}^{n+1}+{u}_{l-1,m}^{n+1}+{u}_{l,m+1}^{n+1}+{u}_{l,m-1}^{n+1}-4{u}_{l,m}^{n+1}+{u}_{l+1,m}^{n}$ $+{u}_{l-1,m}^{n}+{u}_{l,m+1}^{n}+{u}_{l,m-1}^{n}-4{u}_{l,m}^{n}]=0\text{where}\text{\hspace{0.17em}}{R}_{1}=\frac{k}{8h},\text{\hspace{0.17em}}{R}_{2}=\frac{k}{2R{h}^{2}}$ (4)

The scheme shows that the accuracy is of $O\left({k}^{2}+{h}^{2}\right)$ . A Jacobian matrix is now Penta-diagonal, but unfortunately due to large number of iterations it extends from the diagonal at least n entries away in every direction,but another methods which can be used to handle such problems (discussed later), because of the large bandwidth, increasing grid points the calculation become more difficult. To overcome this difficulty another method solution is needed.Newton method is used for solving nonlinear task (discussed later). The Crank- Nicholson is computationally inefficient.

2.2. Computationally Efficient Implicit Scheme

In search of a time efficient alternate, we analyzed that the Crank-Nicholson scheme for the two dimensional equation, and find out that scheme is not time efficient [8] [11] [12] . To get high time efficiency, the common name of Alternating Direction Implicit (ADI) method, can be used [22] .

In this approach, the finite difference equations are written in terms of quantities at two levels However, two different finite difference approximations were used alternately, one to advance the calculations from the plane n to a plane n*, and the second to advance the calculations from (n*)-plane to the (n + 1). Same parameters were used in this method as described above. The derivation of ADI scheme, we have following steps;

Sweep in x-direction

$\begin{array}{c}{u}_{l,m}^{*}-{u}_{l,m}^{n}={P}_{1}\left({u}_{l+1,m}^{*}-2{u}_{l,m}^{*}+{u}_{l-1,m}^{*}+{u}_{l+1,m}^{n}-2{u}_{l,m}^{n}+{u}_{l-1,m}^{n}\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{P}_{2}\left({u}_{l,m+1}^{n}-2{u}_{l,m}^{n}+{u}_{l-1,m}^{n}\right)+{P}_{3}\left({u}_{l,m}^{n}\left({u}_{l+1,m}^{n}-{u}_{l-1,m}^{n}\right)\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{P}_{3}\left({u}_{l,m}^{n}\left({u}_{l,m+1}^{n}-{u}_{l,m-1}^{n}\right)\right)\end{array}$ (5)

${u}_{l,m}^{*}-{u}_{l,m}^{n}={P}_{1}\left({\delta}_{x}^{2}\left({u}_{l,m}^{*}+{u}_{l,m}^{n}\right)\right)+{P}_{2}\left({\delta}_{y}^{2}\left({u}_{l,m}^{n}\right)\right)+kF\left({u}^{n}\right)$ (6)

where

$F\left({u}^{n}\right)={P}_{3}\left({u}_{l,m}^{n}{\delta}_{x}\left({u}_{l,m}^{n}\right)\right)+{P}_{3}\left({u}_{l,m}^{n}{\delta}_{y}{u}_{l,m}^{n}\right)$

Sweep in y-direction

$\begin{array}{c}{u}_{l,m}^{n+1}-{u}_{l,m}^{*}={P}_{1}\left({u}_{l,m+1}^{n+1}-2{u}_{l,m}^{n+1}+{u}_{l,m-1}^{n+1}+{u}_{l,m+1}^{*}-2{u}_{l,m}^{*}+{u}_{l,m-1}^{*}\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{P}_{2}\left({u}_{l+1,m}^{*}-2{u}_{l,m}^{*}+{u}_{l-1,m}^{*}\right)+{P}_{3}\left({u}_{l,m}^{*}\left({u}_{l+1,m}^{*}-{u}_{l-1,m}^{*}\right)\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{P}_{3}\left({u}_{l,m}^{*}\left({u}_{l,m+1}^{*}-{u}_{l,m-1}^{*}\right)\right)\end{array}$ (7)

${u}_{l,m}^{n+1}-{u}_{l,m}^{*}={P}_{1}\left({\delta}_{y}^{2}\left({u}_{l,m}^{n+1}+{u}_{l,m}^{*}\right)\right)+{P}_{2}\left({\delta}_{x}^{2}\left({u}_{l,m}^{*}\right)\right)+kF\left({u}^{*}\right)$ (8)

where

$F\left({u}^{*}\right)={P}_{3}\left({u}_{l,m}^{*}{\delta}_{x}\left({u}_{l,m}^{*}\right)\right)+{P}_{3}\left({u}_{l,m}^{*}{\delta}_{y}{u}_{l,m}^{*}\right)$

${P}_{1}=\frac{k}{Re2{h}^{2}}\mathrm{,}{P}_{2}=\frac{k}{Re{h}^{2}},{P}_{3}=\frac{k}{2h}$

where ${u}_{l\mathrm{,}m}^{\mathrm{*}}$ defines similarly to ${u}_{l\mathrm{,}m}^{n+1}$ . This method is unconditionally stable. The method has accuracy $O\left({k}^{2}+{h}^{2}\right)$ , newton’s iterative method is used to solve tridiagonal system.

The family of linear system in x-direction as:

${a}_{1}{u}_{x,m}^{u*}={b}_{1m}+F\left(k{u}_{x,m}^{n}\right)$ (9)

where $m=1,\cdots ,M-1$

The family of linear system in y-direction as:

${c}_{1}{u}_{y,m}^{n+1}={d}_{1m}+F\left(k{u}_{y,m}^{*}\right)$ (10)

where $l=1,\cdots ,L-1$

where ${a}_{1}\mathrm{,}{c}_{1}$ develops tridiagonal matrix and the array ${b}_{1}\mathrm{,}{d}_{1}$ depends on l and m

The reaction term is x-direction

$F\left(k{u}_{x\mathrm{,}m}^{n}\right)=\left[kF\left({u}_{\mathrm{1,}m}^{n}\right),\cdots ,kF\left({u}_{\mathrm{1,}L-1}^{n}\right)\right]$

similarly for the reaction term in y-direction:

$F\left(k{u}_{y,l}^{*}\right)=\left[kF\left({u}_{1,M-1}^{*}\right),\cdots ,kF\left({u}_{1,1}^{*}\right)\right]$

finally the scheme makes tridiagonal family of linear system.Iterative methods was carried out to solved this system. 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 tridiagonal [5] [7] [8] [9] [11] [17] [22] . To obtain the numerical solution, we need to solve a non-linear tridiagonal system at each time step. We have done this by using Newton’s iterative method

Algorithm 1

To construct Newton iterative method for the two dimensional Convection- diffusion equation. The non-linear system in equations [23] and [24] , can be written in the form:

$G\left(S\right)=0$ (11)

where

$\underset{\_}{S}\approx \left[{\underset{\_}{u}}^{n+1}\right]={\left[{S}_{\mathrm{1,}m}\mathrm{,}{S}_{\mathrm{2,}m},\cdots ,{S}_{\left(2L-2\right)\mathrm{,}m}\right]}^{\text{T}}$

${\underset{\_}{u}}_{\mathrm{:}m}^{n+1}={\left[{u}_{\mathrm{1,}m}^{n+1}\mathrm{,}{u}_{\mathrm{2,}m}^{n+1}\mathrm{,}{u}_{\mathrm{3,}m}^{n+1},\cdots ,{u}_{L-\mathrm{1,}m}^{n+1}\right]}^{\text{T}}$

$\underset{\_}{G}={\left[{G}_{\mathrm{1,}m}\mathrm{,}{G}_{\mathrm{2,}m}\mathrm{,}\cdots ,{G}_{\left(2L-2\right)\mathrm{,}m}\right]}^{\text{T}}$ , where ${G}_{\mathrm{1,}m}\mathrm{,}{G}_{\mathrm{2,}m}\mathrm{,}\cdots ,{G}_{\left(2L-2\right)\mathrm{,}m}$ were system of nonlinear equations obtained from the system in [23] and [24] . The system of equations, is solved by Newton’s iterative method using the following steps

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

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

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

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

where $A\left({u}^{\left(k\right)}\right)$ is $\left(m\times m\right)$ Jacobian matrix, which is computed analytically and $\Delta {u}^{\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({u}^{\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 Court’s method. Convergence done with iterations along less CPU time [5] [14] .

Algorithm 2

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

${a}_{l}{x}_{l-1}+{b}_{l}{x}_{l}+{c}_{l}{x}_{l+1}={S}_{l},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{with}\text{\hspace{0.17em}}{a}_{1}={c}_{l}=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}\mathrm{,}{u}_{2}\mathrm{,}{u}_{3}\mathrm{,}\cdots \mathrm{,}{u}_{n}\right]}^{t}$

$\underset{\_}{S}={\left[{s}_{1}\mathrm{,}{s}_{2}\mathrm{,}{s}_{3}\mathrm{,}\cdots \mathrm{,}{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& \cdots 0\\ {\beta}_{2}& {\mu}_{2}& 0& 0& 0& \cdots 0\\ {\alpha}_{3}& {\beta}_{3}& {\mu}_{3}& 0& 0& \cdots 0\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots 0\\ \cdots & \cdots & {\alpha}_{n-1}& {\beta}_{n-1}& {\mu}_{n-1}& 0\\ \cdots & \cdots & \cdots & {\alpha}_{n}& {\beta}_{n}& {\mu}_{n}\end{array}\right]$

and

$U=\left[\begin{array}{cccccc}1& {\delta}_{1}& {\lambda}_{1}& 0& 0& \cdots 0\\ 0& 1& {\delta}_{2}& {\lambda}_{2}& 0& \cdots 0\\ 0& 0& 1& {\delta}_{3}& {\lambda}_{3}& \cdots 0\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots 0\\ \cdots & \mathrm{...}& 0& 1& {\delta}_{n-2}& {\lambda}_{2}\\ \cdots & \cdots & 0& 0& 1& {\delta}_{n-1}\\ \cdots & \cdots & \cdots & 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.

3. Error Norms

The accuracy and consistency of the schemes is measured in terms of error norms specially ${L}_{2}$ and ${L}_{\infty}$ which are defined as:

$RMSError=\sqrt{\frac{{\displaystyle \underset{i,j=1}{\overset{L}{\sum}}}{\left({U}_{i,j}-{u}_{i,j}\right)}^{2}}{L\times L}}$ (12)

${L}_{\infty}=\underset{1\le i\le L}{\mathrm{max}}{\displaystyle \underset{j=1}{\overset{L}{\sum}}}\left|\left({U}_{i.j}-{u}_{i,j}\right)\right|$ (13)

${L}_{2}=\sqrt{\rho {\left({U}_{i,j}-{u}_{i,j}\right)}^{t}\left({U}_{i,j}-{u}_{i,j}\right)}$ (14)

where $u\left(x,y,t\right)$ and $U\left(x,y,t\right)$ denote the numerical and exact solutions at the grid point $\left({x}_{l}\mathrm{,}{y}_{m}\mathrm{,}{t}_{n}\right)$ . In this method $\rho \left({U}_{i,j}-{u}_{i,j}\right)=\mathrm{max}\left(\lambda \right)$ and $\lambda $ is an eigen value of $\left({U}_{i\mathrm{,}j}-{u}_{i\mathrm{,}j}\right)$ respectively.

4. Results and Discussion

Numerical computations were performed using the uniform grid. In Table 1 & Table 2 Crank-Nicholson and ADI results was performed, compared with the analytical results at grids size 20 $\times $ 20 in problem 1. Moreover by fixing some parameter such as time step k = 0.0001 time level t = 0.5 and Reynolds number Re = 100,500 with different mesh points. The obtained results was compared with the existing results in literature. By describing results same parameters, notations was used as other researchers were used in their studies. For convergence ${L}_{2}\mathrm{,}{L}_{\infty}$ norm were used for the unknown $u\left(x,y,t\right)$ Khater et al. (2008), Mittal and Jiwari (2012), Kutluay and Yagmurlu (2012) and R.C. Mittal and Amit Tripathi were considered this problem in (2016) [21] [23] [24] . Approximate results in problem 1 Table 3, comparison of analytical and numerical results of CN and ADI at fixed Reynolds no Re = 500, time level = 0.0005, time = 1, grid size 30 × 30 with different typical mesh points at (-0.3,-0.3), (−0.45, −0.45), (−0.35, −0.35), (0.25, −0.25). The obtained results makes a very good agreement with the exact solution. To attain more refine and better results by changing time level = 0.001, grid size = 25 × 25 with the same mesh points in Table 4 more refine results was obtained with Reynolds no Re = 50. In Figure 1 analytical and numerical results were compared at grid size 20 × 20 k = 0.0001 time = 0.5 and time level = 0.0001 corresponding results in Table 1. Figure 2 and Figure 3 changing time = 0.1 and grid size 30 × 30 with same time level and Reynolds no as in Figure 1. In both Figure 1 and Figure 2 almost same behavior corresponds to results in Tables 1-4. Similar patterns were depicted by Kutluay and Yagmurlu (2012), Mittal (2016) [21] [24] . The obtained solutions were better than those obtained in earlier studies (Khater et al., 2008; Kutluay and Yagmurlu, 2012, Mittal (2016).

In problem 2, considering Equation (1) over the domain [0.5, 0.5] × [0.5, 0.5], boundary and initial conditions were taken from the exact solution showed stable results time step and increasing grid size (refine mesh size). In Table 5 analytical and numerical results of Crank-Nicholson and ADI were compared at gird size 30 × 30, Re = 200, time = 1, time step = 0.001. In problem 2, Table 6 by reducing grid size 20 × 20, increasing time step k = 0.0001 and time = 3 with fixed Reynolds number attained stable results.

In Figure 4 showed ADI results by reducing Reynolds no Re = 10 with gird size 20 × 20 k = 0.0001 and time = 0.5 and in Figure 5 increasing grid size 101 × 101 at Reynolds 50, time level = 0.0001, time = 0.5, obtained good accuracy corresponds to the exact results.Matrices $\delta {x}^{2}$ and $\delta {y}^{2}$ are more complex in Crank-Nicholson case depend on the order where the grid points are arranged in to the array u. In Table 7 & Table 8 error norm reduced when changing step

Table 1. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 100 at t = 0.5, k = 0.0001 and grid size = 20 × 20 for unknown $u\left(x,y,t\right)$ Problem 1.

Table 2. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 500 at t = 0.5, k = 0.0001 and grid size = 20 × 20 for unknown $u\left(x,y,t\right)$ Problem 1.

Table 3. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 500 at t = 1, k = 0.0005 and grid size = 30 × 30 for unknown $u\left(x,y,t\right)$ .

Table 4. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 50 at t = 1, k = 0.001 and grid size = 25 × 25 for unknown $u\left(x,y,t\right)$ Problem 1.

Figure 1. Analytical and numerical results of CN at t = 0.5, grid size = 20 × 20, k = 0.0001, Re = 500 problem 1.

Figure 2. Numerial results of CN at t = 0.1, grid size = 30 × 30, k = 0.0001, Re = 500 problem 1.

Figure 3. Exact solution of CN at t = 0.1, grid size = 30 × 30, k = 0.0001, Re = 500 problem 1.

Table 5. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 200 at t = 1, k = 0.001 and grid size = 30 × 30 for unknown $u\left(x,y,t\right)$ Problem 2.

Table 6. Comparison of Analytical and Exact solution at different time level with fixed Reynolds number Re = 200 at t = 3, k = 0.0001 and grid size = 20 × 20 for unknown $u\left(x,y,t\right)$ Problem 2.

Figure 4. Numerical results of ADI at t = 0.5, grid size = 20 × 20, k = 0.0001, Re = 10 problem 1.

Figure 5. Analytical and numerical results of ADI at t = 0.5, grid size = 101 × 101, k = 0.0001, Re = 50 problem 1.

Table 7. Calculating errors using different parameters for unknown values u(x, t) at different grid size and time step k at t = 0.05, Re = 1 Problem 2.

Table 8. Calculating errors using different parameters for unknown values u(x, t) at different grid size and time step k at t = 0.25, Re = 1 Problem 2.

Table 9. Calculating Errors using different parameters for unknown values $u\left(x\mathrm{,}t\right)$ at different grid size at k = 0.005, t = 0, Re = 100 Problem 1.

Table 10. Calculating Errors using different parameters for unknown values $u\left(x\mathrm{,}t\right)$ at different grid size at k = 0.005, t = 0.05, Re = 100 Problem 1.

size and grid size with fixed Reynolds no Re = 1, t = 0.05 and 0.25. Good results obtained when compared the values of this exact solution with those of the approximation gained in Tables 1-3. Furthermore in Table 9 error reduced when changing grid size at fixed Reynolds no Re = 100,k = 0.005, time = 0 .In our next computations in Table 10 changing Reynolds no Re and grid size at time = 0.1 error increased. It means that error increase by choosing high Reynolds no Re value.Solution profiles at t = 0.5 and t = 1 have been presented in Figure 6 and Figure 7 for grids sizes 20 × 20 and 30 × 30 at k = 0.001, Re = 50 and 100 respectively. Figure 8 Crank-Nicholson results obtained using same parameters as in Figure 7 with grid size 25 × 25. Solution presented in Figure 9 at grid point 20 × 20, time = 0.5, step size = 0.0001 with large Reynolds no Re = 200 error increased. Solution reported in Table 11 by changing Reynolds no Re and grid sizes at time = 0.1 and k = 0.001, 0.0001 ${L}_{2},{L}_{\infty}$ norm increased. Root mean square value also increased by changing Reynolds no Re. Among all the interior grid points found both ${L}_{2},{L}_{\infty}$ norm of the numerical solution. Figure 10 was presented at grid time = 1, k = 0.001, showed maximum results at time = 0.5. Approximate solution compare with exact of ADI presented in Figure 11 and Figure 12 with grid size 30 × 30 and 20 × 20, time = 2 and 1 respectively. In these figure choosing low Reynolds no Re = 10 at k = 0.0001 presents very refine results in time efficient manner. In Figure 13 by refining mesh sizes showing excellent results at k = 0.0001, Re = 10 and grid sizes 101 × 101. Solution presents in Figure 14 at time = 0 makes a good agreement with the exact solution at time step = 0.0001, Re = 50 respectively.

Results gained by using ADI scheme at very small step spacing to understand the importance of reducing steps. Sharp edges remove during increases time level. These results are very interesting for us to understand the efficiency of the ADI scheme. The corresponding graphical representation for the solution of unknown $u\left(x,y,t\right)$ was presented in Figure 11 and Figure 12. Similar patterns

Figure 6. Numerical results of ADI at t = 0.5, grid size = 20 × 20, k = 0.001, Re = 100 problem 1.

Figure 7. Numerical results of ADI at t = 1, grid size = 30 × 30, k = 0.001, Re = 50 problem 1.

Figure 8. Numerical results of CN at t = 1, grid size = 25 × 25, k = 0.001, Re = 50 problem 1.

Figure 9. Numerical results of CN at t = 0.5, grid size = 20 × 20, k = 0.0001, Re = 200 problem 2.

Table 11. Calculating errors using different parameters for unknown values $u\left(x\mathrm{,}t\right)$ at different Reynold’s number, grid sizes at t = 0.1 Problem 1.

Figure 10. Numerical results of CN at t = 1, grid size = 30 × 30, k = 0.001, Re = 50 problem 2.

Figure 11. Exact and numerical results of ADI at t = 2, grid size = 20 × 20, k = 0.0001, Re = 10 problem 2.

Figure 12. Exact and numerical results of ADI at t = 1, grid size = 30 × 30, k = 0.0001, Re = 10 problem 2.

Figure 13. Analytical and numerical results of ADI at t = 2, grid size = 20 × 20, k = 0.0001, Re = 10 problem 2.

Figure 14. Analytical and numerical results of ADI at t = 0, grid size = 20 × 20, k = 0.0001, Re = 50 problem 2.

have been obtained in earlier studies (Mittal and Jiwari, 2016). In literature point of view present schemes shows similar results as (Jain and Holla, 1978; Mittal and Jiwari, 2016, khater (2008)) [21] [23] . Moreover, got similar results with small grid size. From graphical illustrations, obtained numerical results give steady state solution and the scheme is stable. In Table 9 & Table 10 we observed that results becomes better by changing grid sizes from low to high and by reducing step size.

The obtained results gives excellent agreement with the solutions available in the literature. When the number of grid points get larger than several hundred, the memory and storage of the Crank-Nicholson starts to become a serious issue and it is better to solve this method using different approaches that take advantage of the special form. This method is computationally inefficient. Thomas algorithm avoids having to store having the whole matrix J (Jacobean) in its memory and solve the system much more expediently. ADI methods reduces to the CN scheme and this method solve the system very efficiently.The order of truncation error: $\text{O}\left({k}^{2}+{h}^{2}\right)$ . The implementation of ADI computa- tionally is in a time efficient manner. Alternating direction implicit method is fastest when it works and it works well for simple,ideal problems and give efficient results.

5. Conclusion

In this research work, finite difference methods has been discussed for solving two dimensional convection-diffusion equation. Two test problems were considered, explained the efficiency, accuracy and stability of the schemes. The numerical results showed that Alternating Direction Implicit method is easy to implement and excellent in time efficient manner. The accuracy and stability of these methods were compared to the other numerical methods, shows good agreement with the exact solution. Both ADI and Crank-Nicholson are un- conditionally stable and highly accurate. For convergence ${L}_{2}$ and ${L}_{\infty}$ norms were treated towards zero when grid size was increased. Numerical results showed that both methods are good but ADI method is consistent and time- efficient. The approach used in this paper may be useful to solve higher dimensional partial differential equations appearing in various applications of science and engineering.

Acknowledgements

This research was supported by the division of Numerical Analysis, department of Mathematics, King Abdulaziz University. Authors are thankful to Vineet K. Srivastava Scientist/Engineer-ISTRAC/ISRO, Bangalore, India and M.S. Ismail Department of Maths, King Abdulaziz University, Jeddah, Kingdom of Saudia Arabia, for providing help to understand the numerical technique for highly accurate solution.

Competing Interests

This paper has no financial or non-financial competing interest.

Authors Contribution

The authors contributed to the manuscripts equally.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] |
Pandey, K.P., Lajja, V.L. and Amit, K.V. (2009) On a Finite Difference Scheme for Burgers Equation. Applied Mathematics and Computation, 215, 2208-2214. https://doi.org/10.1016/j.amc.2009.08.018 |

[2] |
Fletcher, C.A. (1983) Generating Exact Solutions of the Two-Dimensional Burgers Equations. International Journal for Numerical Methods in Fluids, 3, 213-216. https://doi.org/10.1002/fld.1650030302 |

[3] |
Collatz, L.C. (1960) The Numerical Treatment of Differential Equations. Springer Verlag, Berlin, 28. https://doi.org/10.1007/978-3-662-05500-7 |

[4] |
Zhu, H.Q., Shu, H.Z. and Ding, M.Y. (2010) Numerical Solution of Two-Dimensional Burgers’ Equations by Discrete Adomian Decomposition Method. Computers and Mathematics with Applications, 60, 840-848. https://doi.org/10.1016/j.camwa.2010.05.031 |

[5] | Mazumder, S.M. (2015) Numerical Methods for Partial Differential Equations: Finite Difference and Finite Volume Methods. Academic Press, New York. |

[6] |
Bateman, H.B. (1915) Some Recent Researches on the Motion of Fluids. Monthly Weather Review, 43, 163-170. https://doi.org/10.1175/1520-0493(1915)43<163:SRROTM>2.0.CO;2 |

[7] | Crandall, S.H. (1956) Engineering Analysis. McGraw-Hill, New York, 151. |

[8] | Noye, J.N. (1981) Nonlinear Partial Differential Equations in Engineering. University of Melbourne, Melbourne. |

[9] |
Schiesser, W.E. and Griffiths, G.W. (2009) A Compendium of Partial Differential Equation Models. Cambridge University Press, Cambridge. https://doi.org/10.1017/CBO9780511576270 |

[10] | Srivastava, V.K. and Tamsir, M.T. (2012) Crank Nicolson Semi Implicit Approach for Numerical Solution of Two Dimensional Coupled Non-Linear Burgers Equations. International Journal of Applied Mechanics and Engineering, 17, 571-581. |

[11] | Ames, W.F. (1965) Non-Linear Partial Differential Equations in Engineering. Academic Press, New York. |

[12] | Ames, W.F. (1969) Finite Difference Methods for Partial Differential Equations. Academic Press, New York. |

[13] | James, E.F. (2002) An Introduction to Numerical Analysis. John Wiley and Sons, New York. |

[14] | Roache, P.J. (1972) Computational Fluid Dynamics. Hermosa, Albuquerque. |

[15] | Mohammad, T.M. and Vineet, K.S. (2011) A Semi-Implicit Finite-Difference Approach for Two-Dimensional Coupled Burgers Equations. International Journal of Scientific and Engineering Research, 2, 9-18. |

[16] |
Bahadir, A.B. (2003) A Fully Implicit Finite-Difference Scheme for Two-Dimensional Burger’s Equation. Applied Mathematics and Computation, 137, 137-131. https://doi.org/10.1016/S0096-3003(02)00091-7 |

[17] | Kanti, P.K. and Lajja, V.L. (2011) A Note on Crank-Nicolson Scheme for Burgers Equation. Applied Mathematics, 2, 888-899. |

[18] | Richard, B.L. and Douglas, J.F. (2001) Numerical Analysis. 7th Edition, Brooks/ Cole, Pacific Grove. |

[19] |
Cole, J.D. (1951) On a Quasilinear Parabolic Equations Occurring in Aerodynamics. Quarterly of Applied Mathematics, 9, 225-235. https://doi.org/10.1090/qam/42889 |

[20] | Holla, P.J. (1987) Numerical Solution of Coupled Burger’s Equations. International Journal for Numerical Methods in Engineering, 12. |

[21] |
Mittal, R.C. and Tripathi, A. (2015) Numerical Solutions of Two-Dimensional Burgers Equations Using Modified Bi-Cubic B-Spline Finite Elements. Engineering Computations, 32, 1275-1306. https://doi.org/10.1108/EC-04-2014-0067 |

[22] | Lakoba, T.L. (2015) The Heat Equation in 2 and 3 Spatial Dimensions. University of Vermont, Burlington. |

[23] |
Temsah, R.S. and Hassan, M.M. (2008) A Chebyshev Spectral Collocation Method for Solving Burgers-Type Equations. Journal of Computational and Applied Mathematics, 222, 333-350. https://doi.org/10.1016/j.cam.2007.11.007 |

[24] | Yagmurlu, K.S.N. (2012) The Modified Bi-Quintic B-Splines for Solving the Two-Dimensional Unsteady Burgers Equation. European International Journal of Science and Technology, 1, 23-39. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 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.