See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/317841192

Two-Dimensional Nonlinear Reaction Diffusion Equation with Time Efficient

Scheme

Article in American Journal of Computational Mathematics · June 2017

DOI: 10.4236/ajcm.2017.72017

CITATIONS READS

2 295

2 authors:

Shahid Hasnain Muhammad Saqib

Air University of Islamabad Air University of Islamabad
11 PUBLICATIONS 26 CITATIONS 15 PUBLICATIONS 28 CITATIONS

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Douglas Scheme for 3D Reaction Diffusion Local Equation View project

Douglas Scheme for 3D Reaction Diffusion Local equation View project

All content following this page was uploaded by Shahid Hasnain on 23 June 2017.

The user has requested enhancement of the downloaded file.

 American Journal of Computational Mathematics, 2017, 7, 183-194
http://www.scirp.org/journal/ajcm
ISSN Online: 2161-1211
ISSN Print: 2161-1203

Two-Dimensional Nonlinear Reaction Diffusion

Equation with Time Efficient Scheme

Shahid Hasnain, Muhammad Saqib, Daoud Suleiman Mashat

Department of Mathematics, Numerical Analysis, King Abdulaziz University, Jeddah, KSA

How to cite this paper: Hasnain, S., Saqib, Abstract

M. and Mashat, D.S. (2017) Two-Dimen-
sional Nonlinear Reaction Diffusion Equa- This research paper represents a numerical approximation to non-linear
tion with Time Efficient Scheme. American two-dimensional reaction diffusion equation from population genetics. Since
Journal of Computational Mathematics, 7,
various initial and boundary value problems exist in two-dimensional reac-
183-194.
https://doi.org/10.4236/ajcm.2017.72017 tion-diffusion, phenomena are studied numerically by different numerical
methods, here we use finite difference schemes to approximate the solution.
Received: January 31, 2017 Accuracy is studied in term of L2 , L∞ and relative error norms by random
Accepted: June 20, 2017
Published: June 23, 2017 selected grids along time levels for comparison with exact results. The test
example demonstrates the accuracy, efficiency and versatility of the proposed
Copyright © 2017 by authors and schemes. It is shown that the numerical schemes give better solutions. More-
Scientific Research Publishing Inc.
This work is licensed under the Creative
over, the schemes can be easily applied to a wide class of higher dimension
Commons Attribution International nonlinear reaction diffusion equations with a little modification.
License (CC BY 4.0).
http://creativecommons.org/licenses/by/4.0/ Keywords
Open Access
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,

DOI: 10.4236/ajcm.2017.72017 June 23, 2017

S. Hasnain et al.

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 ∂ x p at that boundary,
x being the
coordinate measuring position in the linear habitat [5]. Then p must satisfy
the differential equation,
=
pt kpxx + 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
ut = β ( u xx + u yy ) + α f ( u ) 
 (2)
ut = ∇ ⋅ ( β∇u ) + α f ( u ) 

where u is a dimensionless temperature or population density, ut is the rate

of increase of u with time t , ∇ is the gradient operator in two dimensional
space, β is a constant second order tensor measuring the diffusivity of the
media, and f ( u ) is a non-linear function of u representing the effect of
reaction or multiplication. Also µ represents reactive constant after diffusion
occurs. Assuming β1 and β 2 are the principal values of β as in Equation
(2) and x and y are coordinates along the principle axes, Equation (2) can be
written as
ut = β1u xx + β 2 u yy + α u (1 − u ) (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],
  xπ   yπ   
u ( x, y , t ) =
20 + 80  y − e Dt sin   sin    
  2   2  
 (4)
β π2 
Where D = −
2 

4. Numerical Methods
We consider the numerical solution of the non-linear Equation (3) in a finite

184
 S. Hasnain et al.

domain
= Ω {( x, y ) }
a < x < b, c < y < d . The first step is to choose integers n
and m to define step sizes h= (b − a ) n and =
k (d − c) 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
( xi , y j ) , where xi= a + ih for each i = 0,1, 2, n and y j = c + jk for each
j = 0,1, 2, m also the lines x = xi 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, (x , y )=
i j, for i 1, 2, , n − 1 =
and j 1, 2, , 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, , where t is the time.

4.1. Second Order Implicit Scheme

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

uˆl +1, m − 2uˆl , m + uˆl −1, m 

δ x2 uˆ = 
h2 
uˆ − 2 uˆ + uˆ 
δ y2 uˆ = l , m +1 l ,m l , m −1

h2 

vˆl +1, m − 2vˆl , m + vˆl −1, m 
δ x vˆ =
2

h2

vˆ + − 2 ˆ
v + ˆ
v −

δ y2 vˆ = l , m 1 l , m l , m 1

h 2


k β1 2 n +1 kβ 
uin, +j 1 =uin, j +
2hx2
( ) (
δ x ui , j + uin, j + 22 δ y2 uin, +j 1 + uin, j 
2 hy
)

k µ n +1 
 
+
2
( ) 1
(
ui , j + uin, j 1 − uin, +j 1 + uin, j 
 2 
) 


k β1 k β2 kµ 
=
Where R1 = , R2 =
and Q1  (5)
2hx2 2hy2 2 

( ) (
uin, +j 1 =uin, j + R1δ x2 uin, +j 1 + uin, j + R2δ y2 uin, +j 1 + uin, j  )

 1 n +1  
( n +1
)
+ Q1 ui , j + ui , j 1 − ui , j + ui , j 
n

 2
n
( 
) 



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:
1
Introduce an FTCS scheme for the first time step = n + , of the form
2

185
S. Hasnain et al.

ui, j − uin, j β1  
∆t 2
− 2 (u 
i −1, j − 2ui, j + ui+1, j
  )
h x  
β2 n  
(
− 2 ui , j −1 − 2uin, j + uin, j +1 =
hy
µ f uin, j 



) ( )
 
in the compact form, above equation can be seen as: 
 
ui, j − uin, j
∆t 2
µ f uin, j 
− S1 Lxx ui, j − S2 Lyy uin, j = 
 ( )
  (6)
above equation can be written as in algorithm  
 
=
form, for i 1, 2,3, , n − 1  

1 1 
− R1ui−1, j + (1 + R1 ) ui, j − R1ui+1, j 
2 2 

µ∆t
=
1 1
R2 uin, j −1 + (1 − R2 ) uin, j + R2 uin, j +1 + f uin, j  ( )

2 2 2
above algorithm validates its results = for i 1, 2,3, , n − 1

Now let us consider the second time step,

uin, +j 1 − ui, j β1  
∆t 2
− 2 (u 
i −1, j − 2ui, j + ui+1, j
  )
h x  
β 2 n +1  
(
− 2 ui , j −1 − 2uin, +j 1 + uin, +j 1+1 =
hy
)
µ f ui, j 



( )
 
in the compact form, above equation can be seen as: 
 
uin, +j 1 − ui, j
∆t 2
 n +1
− S1 Lxx ui , j − S2 Lyy ui , j =  
µ f ui , j  
 ( )
  (7)
above equation can be written as in  

algorithm form, = for j 1, 2,3, , m − 1 

1 1 
− R2 uin−+1,1 j + (1 + R2 ) uin, +j 1 − R2 uin++1,1 j 
2 2

µ∆t
=
1   1
R1ui −1, j + (1 − R1 ) ui , j + R1ui +1, j +
  
f ui , j  ( )

2 2 2
above algorithm validates its results = for j 1, 2,3, , m − 1

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 (W ) = 0 (8)

=where R (=
r1 , r2 , r3 , , r2 n ) , W
t
(u n +1
1 , v1n +1 , u2n +1 , v2n +1 , , umn +1 , vmn +1 ) and
r1 , r2 , r3 , , r2 n 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

186
 S. Hasnain et al.

following steps
1) Specify W ( 0 ) as an initial approximation.
2) For k = 0,1, 2,. until convergence achieve.
• Solve the linear system A W ( k ) ∆W ( k ) =(
−R W ( ) ,
k
) ( )
• Specify W ( k=
+1)
W ( ) + ∆W ( ) ,
k k

(
where A W ( k )
(k )
) is (m × m) Jacobian matrix, which is computed analytically
and ∆W 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 (
R W(
k)
) ∞
≤ 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 × m . In general a tridiagonal system can be written as,
ai xi −1 + bi xi + ci xi +1 =Si , with a1 =cn =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
 b1 c1 0 0 0  0
 
 a2 b2 c2 0 0  0
      

J =      
 
     
 
   an −1 bn −1 cn −1 
 
    an bn 

u = [u1 , u2 , u3 , , un ]
t

S = [ s1 , s2 , s3 , , sn ]
t

technique is explained in the following steps,

J = LU
where
 µ1 0 0 0 0 ...0 
 
β2 µ2 0 0 0 ...0 
α β3 µ3 0 0 ...0 
L=
3
 ... ... ... ... ... ...0 
 
 ... ... α n −1 β n −1 µn −1 0
 
 ... ... ... αn βn µn 

And

187
S. Hasnain et al.

1 δ1 λ1 0 0 ...0 
0 1 δ2 λ2 0 ...0 

0 0 1 δ3 λ3 ...0 
 
U = ... ... ... ... ... ...0 
... ... 0 1 δ n−2 λ2 
 
... ... 0 0 1 δ n −1 
... 1 
 ... ... 0 0

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 L2 and L∞ [23] [24] [25] [26] which are defined as:
m

L∞ =
u ecact − u Approximation
∞
=max ∑
1≤ i ≤ m j =1
u ecact
j − u Approximation
j 

m 
L2 =
u ecact − u Approximation = ∑ u ecact
j − u Approximation
j 
2
j =1 

2 
∑∑ uiecact ,j − uiApproximation
,j  (9)
Errorrelative =
i j 

∑ uiexact
2
,j 

j

Rate =
(
log Errorh Errorh 2 

)
log ( h ( h 2 ) ) 

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, β=1 β=
2 1 and β= 1 β=
2 1 4 . Scheme convergence viewed
through L2 , L∞ , 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

Table 1. Estimates of results using Crank Nicolson with some fixed parameters such as
k = 0.0001 , t = 1 at different grids and [ a, b ] = [ −10 10] . Error magnifies through L2 ,
L∞ and Errorrelative .

β=
1
β=
2
1 β=
1
β=
2
14

Time = t x L2 L∞ Lrelative L2 L∞ Lrelative

1 21 × 21 0.0639 0.0109 0.0099 0.0531 0.0109 0.0097

51 × 51 0.0313 0.0059 0.0043 0.0213 0.0051 0.0031
101 × 101 0.0112 0.0017 0.0009 0.0115 0.0021 0.00099

188
 S. Hasnain et al.

Table 2. Estimates of results using Crank Nicolson with some fixed parameters such as
k = 0.0001 , grid= 61 × 61 at different time level and [ a, b ] = [ −10 10] . Error magnifies
through L2 , L∞ and Errorrelative .

β=
1
β=
2
1 β=
1
β=
2
14

Grid t L2 L∞ Lrelative L2 L∞ Lrelative

61 × 61 0.2 0.0791 0.0692 0.0543 0.0789 0.0670 0.0512

0.4 0.0998 0.0891 0.0753 0.0990 0.0881 0.0615
0.6 0.1386 0.0993 0.0991 0.1189 0.0987 0.0899

Table 3. Estimates of results using ADI scheme, such as k = 0.0001 , t = 1 at different

grids and [ a, b ] = [ −10 10] . Error magnifies through L2 , L∞ and Errorrelative .

β=
1
β=
2
1 β=
1
β=
2
14

Time = t x L2 L∞ Lrelative L2 L∞ Lrelative

1 21 × 21 0.0304 0.0211 0.0069 0.0344 0.0209 0.0063

51 × 51 0.0110 0.0073 0.0037 0.0210 0.0079 0.0033
101 × 101 0.0099 0.0051 0.00099 0.0100 0.0062 0.000891

Table 4. Estimates of results using ADI scheme with some fixed parameters such as
k = 0.0001 , grid= 61 × 61 at different time level and [ a, b ] = [ −10 10] . Error magnifies
through L2 , L∞ and Errorrelative .

Crank Scheme ADI Scheme

Grid t L2 L∞ Lrelative L2 L∞ Lrelative

61 × 61 0.2 0.0263 0.0231 0.0181 0.0263 0.0223 0.0171

0.4 0.0332 0.0297 0.0251 0.0331 0.0294 0.0205
0.6 0.0462 0.0331 0.0330 0.0396 0.03167 0.0890

Table 5. Estimates of results using ADI and Crank Nicolson schemes, with reducing step
size.

β=
1
β=
2
1 β=
1
β=
2
14

Grid Step Size L2 L∞ Lrelative L2 L∞ Lrelative

61 × 61 h 0.0197 0.0117 0.00585 0.0205 0.01897 0.00889

h/2 0.0027 0.0021 0.000675 0.0089 0.0051 0.000989
h/8 0.0012 0.00096 0.00015 0.0021 0.00099 0.00049

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

189
S. Hasnain et al.

Table 6. Presents results using ADI and CN schemes, with rate of convergence.

CN Scheme ADI Scheme

Rate Rate Rate Rate Rate Rate

Time t = 1 Grid
L2 L∞ Lrelative L2 L∞ Lrelative

1 41 × 41 2.9385 - - - - -
101 × 101 2.9187 1.6739 1.001 2.1131 1.0843 0.0471
201 × 201 1.231 1.1129 1.0009 1.0938 1.0627 0.0710

Figure 1. Shows results using CN scheme, at different time levels, fixed some parameters as
we mentioned in Table 1.

Figure 2. Shows results using CN scheme, at different grids, fixed some parameters as we
mentioned in Table 1 & Table 2.

190
 S. Hasnain et al.

Figure 3. Shows results using ADI scheme, at different grids, fixed some
parameters as we mentioned in Table 3 & Table 4.

Figure 4. Shows results using ADI scheme, at different time levels, fixed
some parameters as we mentioned in Table 3 & Table 4.

Figure 5. Shows results using ADI scheme, for two different h. See Table 5.

191
S. Hasnain et al.

Figure 6. Shows results at different time for simple error in the concentration of the
diffusion reaction phenomena. As we mentioned in this paper u(x, y, t) be the
concentration of the chemical. With step-up in grid size, make significant change in error
but incremental in time, increase error as we can see from this figure. With increase in
time, reduce the sharp edge as we mentioned in figure by arrows. These results are very
interesting during simulations.

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

References
[1] Fisher, R.A. (1936) The Wave of Advance of Advantageous Genes. Annals of Hu-
man Genetics, 7, 355-369. https://doi.org/10.1111/j.1469-1809.1937.tb02153.x
[2] Kolmogorov, A.K., Petrovsky, N.P. and Piscounov, S.P. (1937) Etude de I equations
de la diffusion avec croissance de la quantitate de matiere et son application a un
probolome biologique. Bull. Univ. Mosku, 1, 1-25.
[3] Newman, W.I. (1980) Some Exact Solutions to a Non-Linear Diffusion Problem in
Population Genetics and Combustion. Journal of Theoretical Biology, 85, 325-334.
[4] Ronson, D.G. and Weinberger, H.F. (1975) Nonlinear Diffusion in Population Ge-
netics, Combustion, and Nerve Pulse Propagation. Springer-Verlag., Berlin, 5-49.
https://doi.org/10.1007/BFb0070595
[5] Franak Kameneetiskii, D.A. (1969) Diffusion and Heat Transfer in Chemical Kinet-
ics. 1st Edition, Plenum Press, New York.
[6] Canosa, J.C. (1973) On a Nonlinear Diffusion Equation Describing Population
Growth. IBM Journal of Research Development, 17, 307-313.
https://doi.org/10.1147/rd.174.0307
[7] Arnold, R.A., Showalter, K. and Tyson, J.J. (1987) Propagation of Chemical Reac-
tions in Space. Journal of Chemical Education, 64, 740-7744.
https://doi.org/10.1021/ed064p740
[8] Tuckwell, H.C. (1988) Introduction to Theoretical Neurobiology. Cambridge Uni-
versity Press, Cambridge.
[9] Argyris, J.A., Haase, M.H. and Heinrich, J.C. (1991) Finite Element Approximation

192
 S. Hasnain et al.

to Two-Dimensional Sine Gordon Equations. Computer Methods in Applied Me-

chanics and Engineering, 86, 1-26.
[10] Aronson, D.G. and Weinberger, H.F. (1978) Multidimensional Non-Linear Diffu-
sion Arising in Population Genetics. Advance in Mathematics, 30, 33-76.
[11] Grimshaw, R.G. and Tang, S.T. (1990) The Rotation-Modified Kadomtsev-Pet-
viashvili Equation: An Analytical and Numerical Study. Studies in Applied Mathe-
matics, 83, 223-248. https://doi.org/10.1002/sapm1990833223
[12] Tang, S.T., Qin, S.Q. and Weber, R.O. (1991) Numerical Solution of a Non-Linear
Reaction Diffusion Equation. Applied Mathematics and Mechanics, 12, 751-758.
[13] Tang, S.T. and Weber, R.O. (1991) Numerical Study of Fisher’s Equation by a Pe-
trov-Galerkin Finite Element Method. The ANZIAM Journal, 33, 27-38.
https://doi.org/10.1017/S0334270000008602
[14] Williams, S.W. and Chow, P.L. (1978) Nonlinear Reaction-Diffusion Models for
Interacting Populations. Journal of Mathematical Analysis and Applications, 62,
157-169.
[15] Maynard Smith, J.M. (1971) Models in Ecology. Cambridge University Press, Cam-
bridge.
[16] Hilborn, R.H. (1975) The Effect of Spatial Heterogeneity on the Persistence of Pre-
dator-Prey Interactions. Theoretical Population Biology, 8, 346-355.
[17] Burgers, J.M. (1948) A Mathematical Model Illustrating the Theory of Turbulence.
In: Advances in Applied Mechanics, Vol. 1, Academic Press, Inc., New York, 171-
199.
[18] 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
[19] Wang, X.Y. (1988) Exact and Explicit Solitary Wave Solutions for the Generalized
Fisher Equation. Physics Letters A, 131, 227-279.
[20] Gazdag, J.G. and Canosa, J.C. (1974) Numerical Solutions of Fisher’s Equation.
Journal of Applied Probability, 11, 445-457.
https://doi.org/10.1017/S0021900200096236
[21] Logan, D.J. (1994) An Introduction to Nonlinear Partial Differential Equations.
Wiley, New York.
[22] Evans, D.J. and Sahimi, M.S. (1989) The Alternating Group Explicit (AGE) Iterative
Method to Solve Parabolic and Hyperbolic Partial Differential Equations. Annals of
Numerical Fluid Mechanics and Heat Transfer, 2, 283-389.
[23] Ames, W.F. (1965) Nonlinear Partial Differential Equations in Engineering. Acade-
mic Press, New York.
[24] Ames, W.F. (1969) Finite Difference Methods for Partial Differential Equations.
Academic Press, New York.
[25] Noye, J.N. (1981) Nonlinear Partial Differential Equations in Engineering. North-
Holland Publishing Comp. Conference in Queen’s College, University of Mel-
bourne, Australia.
[26] Ablowitz, M.J. and Zeppetella, A.Z. (1979) Explicit Solutions of Fisher’s Equation
for a Special Wave Speed. Bulletin of Mathematical Biology, 41, 835-840.
https://doi.org/10.1007/BF02462380
[27] Wasow, W.W. (1955) Discrete Approximation to Elliptic Differential Equations.
Zeitschrift für Angewandte Mathematik und Physik ZAMP, 6, 81-97.
[28] Schiesser, W.E. and Griffiths, G.W. (2009) A Compendium of Partial Differential

193
 S. Hasnain et al.

Equation Models. Cambridge University Press, Cambridge.

https://doi.org/10.1017/CBO9780511576270
[29] Whitham, G.B. (1974) Linear and Nonlinear Waves. John Wiley & Sons, Hoboken.
[30] Babuska, I.B. (1968) Numerical Stability in Mathematical Analysis. IFIP Congress,
North-Holland, Amsterdam, 11-23.
[31] Kanti, P.K. and Lajja, V.L. (2011) A Note on Crank-Nicolson Scheme for Burgers
Equation. Applied Mathematics, 2, 888-899.
[32] Roache, P.J. (1972) Computational Fluid Dynamics. Hermosa, Albuquerque.
[33] Mazumder, S.M. (2015) Numerical Methods for Partial Differential Equations: Fi-
nite Difference and Finite Volume Methods. Academic Press, New York.
[34] Srivastava, V.K. and Tamsir, M.T. (2012) Crank Nicolson Semi-Implicit Approach
for Numerical Solution of Two Dimensional Coupled Nonlinear Burgers Equations.
International Journal of Applied Mechanics and Engineering, 17, 571-581.

Submit or recommend next manuscript to SCIRP and we will provide best

service for you:
Accepting pre-submission inquiries through Email, Facebook, LinkedIn, Twitter, etc.
A wide selection of journals (inclusive of 9 subjects, more than 200 journals)
Providing 24-hour high-quality service
User-friendly online submission system
Fair and swift peer-review system
Efficient typesetting and proofreading procedure
Display of the result of downloads and visits, as well as the number of cited articles
Maximum dissemination of your research work
Submit your manuscript at: http://papersubmission.scirp.org/
Or contact ajcm@scirp.org

194

View publication stats