# On the Bivariate Spectral Homotopy Analysis Method Approach for Solving Nonlinear Evolution Partial Differential Equations

Authors: S. S. Motsa
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper presents a new application of the homotopy analysis method (HAM) for solving evolution equations described in terms of nonlinear partial differential equations (PDEs). The new approach, termed bivariate spectral homotopy analysis method (BISHAM), is based on the use of bivariate Lagrange interpolation in the so-called rule of solution expression of the HAM algorithm. The applicability of the new approach has been demonstrated by application on several examples of nonlinear evolution PDEs, namely, Fisher’s, Burgers-Fisher’s, Burger-Huxley’s, and Fitzhugh-Nagumo’s equations. Comparison with known exact results from literature has been used to confirm accuracy and effectiveness of the proposed method.


---

## Body

## 1. Introduction

The study of nonlinear evolution partial differential equations (PDEs) is a vast area of research with well-developed and documented theories and applications in almost all areas of science and engineering. The PDEs are used to describe many complex nonlinear settings in applications such as vibration and wave propagation, fluid mechanics, plasma physics, quantum mechanics, nonlinear optics, solid state physics, chemical kinematics, physical chemistry, population dynamics, and many other areas of mathematical modelling. The development of both analytical and numerical methods for solving complicated highly nonlinear PDEs continues to be a fertile area of research geared towards enriching and deepening our understanding of these intriguing nonlinear problems.The homotopy analysis method (HAM) has been widely discussed in the literature for solving both nonlinear ordinary and partial differential equations. A comprehensive exposition of the underlying concepts and applications of the HAM can be found in recently published books [1–4]. A unique feature of the HAM, which sets it apart from all perturbative and nonperturbative methods reported in the literature, is the flexibility to vary its embedded convergence controlling auxiliary parameters and functions. Previous studies have illustrated that a carefully selected choice of auxiliary linear operators result in significant improvement of the convergence and accuracy of the HAM [5–7]. Baxter et al. [5] examined multiple auxiliary linear operators to find the best operator that yields the best accuracy for the solution of the Cahn-Hilliard equation, a nonlinear partial differential equation. The linear operators in the study of Baxter et al. [5], as well as in numerous other HAM based studies for solving nonlinear PDEs, are conveniently chosen to guarantee that the HAM algorithm yields analytical series solutions. The limitation of these HAM based approaches that seek to obtain completely analytical results is that generating incremental terms of the HAM series solution becomes progressively cumbersome and the problem solving exercise becomes intractable eventually. This is particularly true when a nontrivial linear operator is used or required for optimal accuracy. Accordingly, an approach that can admit any form of linear operator, no matter how complex, is required in the HAM algorithm. However, complicated linear operators preclude the possibility of resolving the HAM series solutions analytically. Motsa et al. [8, 9] proposed a discrete version of the HAM that is based on Chebyshev spectral collocation approach for implementing the HAM algorithm which was otherwise impossible to solve analytically. This discrete variant of the HAM was called the spectral homotopy analysis method (SHAM) in [8, 9]. The SHAM has recently been extended to solve a nonlinear partial differential equation based problem of unsteady boundary layer flow caused by an impulsively stretching plate in [10]. Motsa [10] used a partial differential equation based auxiliary operator to improve on the ordinary derivative based linear operator approach used previously by Liao [11] to solve same problem. Motsa [10] concluded that when solving nonlinear PDEs, the use of PDE based linear operators leads to better results than the use of ODE based linear operators. In implementing the method, the decomposed equations were solved by applying the spectral method in the space variable and monomial series expansion in the time variable. This approach was found to work well for the unsteady boundary layer problem considered in [10] because the dimensionless time variable was defined in the range ξ
∈
[
0,1
]. However, series approaches of this kind are well known to have the capacity to resolve accurate solutions only in the region 0
≤
ξ
<
1. Consequently, there is a need to develop variants of the SHAM that give solutions that are uniformly valid including regions where ξ
≫
1. More robust SHAM variations are needed for the solution of complex nonlinear PDEs that model important problems with wide applications in science, engineering, and other areas of applied mathematics.The main objective of this work is to introduce a new variant of the spectral homotopy analysis method for solving nonlinear partial differential equations. The proposed method is developed by defining a rule of solution expression based on bivariate Lagrange interpolation. The homotopy analysis method algorithm is then applied to decompose the governing nonlinear PDEs into a sequence of linear PDEs. The resulting linear sequence of PDEs contains variable coefficients and is impossible to solve exactly. Consequently, the Chebyshev spectral collocation method is applied independently in the space and time independent variables. In view of the application of the combination of bivariate interpolation and spectral collocation differentiation, the new method is called bivariate interpolated spectral homotopy analysis method (BI-SHAM). The study presents a general BI-SHAM algorithm that can be used to solve second order nonlinear evolution equations. The applicability, accuracy, and reliability of the proposed BI-SHAM is confirmed by solving the Fisher, Burger-Fisher, Burger-Huxley, and Fitzhurg-Nagumo equations. The BI-SHAM results are compared against known exact solutions that have been reported in the scientific literature.The remainder of the paper is organized as follows. In Section2, we introduce the algorithm of the Bi-SHAM for a general nonlinear evolution PDE. Section 3 describes the application of the BI-SHAM in the problems that are selected for numerical experimentation. The numerical simulations and results are presented in Section 4. Finally, we conclude and describe future work in Section 5.


## 2. Bivariate Interpolated Spectral Homotopy Analysis Method (BI-SHAM)

In this section we introduce theBivariate Interpolated Spectral Homotopy analysis Method (BI-SHAM) used to solve the governing nonlinear evolution PDEs. Without loss of generality, we consider nonlinear PDEs of the form
(1)
u
t
=
H
(
u
,
u
x
,
u
x
x
)
,
where u
(
x
,
t
) is the solution and H is a nonlinear operator which contains all the spatial derivatives of u. The solution procedure is based on the initial assumption that the solution can be approximated by a bivariate Lagrange interpolation polynomial of the form
(2)
∑
m
=
0
+
∞
‍
∑
r
=
0
N
‍
∑
s
=
0
M
‍
u
m
M
,
N
(
x
r
,
t
s
)
ϕ
r
(
x
)
ϕ
s
(
t
)
,
which interpolates u
m
(
x
,
t
) independently at selected points in both the x and t directions defined as follows:
(3)
{
x
r
}
=
{
cos
⁡
(
π
r
N
)
}
r
=
0
N
,
{
t
s
}
=
{
cos
⁡
(
π
s
M
)
}
s
=
0
M
.
The choice of grid points (3), which are called Chebyshev-Gauss-Lobatto points, ensures that there is a simple conversion of the continuous derivatives, in both space and time, to discrete derivatives at the grid points as will be discussed later. The functions ϕ
r
(
x
) are the characteristic Lagrange cardinal polynomials defined as follows:
(4)
ϕ
j
(
x
)
=
∏
j
=
0
j
≠
k
M
x
-
x
k
x
j
-
x
k
,
which obey the Kronecker delta equation. Consider
(5)
ϕ
j
(
x
k
)
=
δ
j
k
=
{
0
if
j
≠
k
1
if
j
=
k
.
The functions ϕ
s
(
t
) are defined in a similar manner.To derive the HAM equations corresponding to the nonlinear equation (1), it is convenient to rewrite the governing equation in the form
(6)
F
[
u
,
u
′
,
u
′′
]
+
G
[
u
,
u
′
,
u
′′
]
-
u
˙
=
0
,
where the dot and primes denote the time and space derivatives, respectively, F is a linear operator, and G is a nonlinear operator. A crucial step in the implementation of the solution procedure is the evaluation of the time derivative at the grid points t
i (i
=
0,1
,
…
,
M). Before the derivative is applied, the given physical region, say t
∈
[
0
,
T
], is converted to the region τ
∈
[
-
1,1
] using the linear transformation t
=
T
(
τ
+
1
)
/
2. The values of the derivatives at the Chebyshev-Gauss-Lobatto points τ
i are computed as follows:
(7)
∂
u
∂
t
|
t
=
t
i
=
2
∑
j
=
0
M
‍
d
i
,
j
u
j
(
x
)
,
i
=
0,1
,
2
,
…
,
M
,
where u
j
=
u
(
x
,
τ
j
), d
i
,
j
(
i
,
j
=
0,1
,
…
,
M
) are entries of the standard Chebyshev differentiation matrix d
=
[
d
i
,
j
] of size (
M
+
1
)
×
(
M
+
1
) (see, e.g., [12, 13]). By evaluating (6) at the grid points τ
i, we obtain
(8)
F
[
u
i
,
u
i
′
,
u
i
′′
]
+
G
[
u
i
,
u
i
′
,
u
i
′′
]
-
2
∑
j
=
0
M
‍
d
i
j
u
j
=
0
,
i
=
0,1
,
2
,
…
,
M
.If the initial condition for (1) is given at t
=
0 (corresponding to τ
M
=
-
1), we write (8) as follows:
(9)
F
[
u
i
,
u
i
′
,
u
i
′′
]
+
G
[
u
i
,
u
i
′
,
u
i
′′
]
-
2
∑
j
=
0
M
-
1
‍
d
i
j
u
j
=
2
d
i
M
u
M
,
i
=
0,1
,
2
,
…
,
M
-
1
,
where u
M
(
x
)
=
u
(
x
,
0
) is the known initial condition.Equation (9) forms a system of M coupled nonlinear ordinary differential equations with unknowns u
i
(
x
), i
=
0,1
,
2
,
…
,
M
-
1. Below, we describe the spectral homotopy analysis method used to solve (9).The algorithm of the HAM begins with the construction of the homotopy for a given linear operatorL
[
U
i
] defined as follows:
(10)
0
≡
H
(
U
i
,
u
i
,
0
;
q
)
=
(
1
-
q
)
L
[
U
i
(
x
;
q
)
-
u
i
,
0
(
x
)
]
-
q
ℏ
{
N
[
U
i
(
x
;
q
)
]
-
2
d
i
M
u
M
}
,
where
(11)
L
[
U
i
]
=
F
[
U
i
,
U
i
′
,
U
i
′′
]
-
2
∑
j
=
0
M
-
1
‍
d
i
j
U
j
,
(12)
N
[
U
i
]
=
L
[
U
i
]
+
G
[
U
i
,
U
i
′
,
U
i
′′
]
,
i
=
0,1
,
2
,
…
,
M
;
q
∈
[
0,1
] is an embedding parameter; ℏ denotes a nonzero convergence controlling auxiliary parameter; u
i
,
0
(
x
) is the initial approximation of the solution of u
i for i
=
0,1
,
2
,
…
,
M
-
1. It should be emphasised that, in the specialized language of the HAM, the homotopy equation (10) is referred to as the zeroth order deformation equation. From (10) it can be noted that, as q increases from 0 to 1, U
i
(
x
;
q
) varies from the initial approximation u
i
,
0
(
x
) to the solution u
i
(
x
) of nonlinear equation (9). Expanding U
i
(
x
;
q
) using Taylor series about q gives
(13)
U
i
(
x
;
q
)
=
U
i
(
x
;
0
)
+
∑
m
=
1
+
∞
‍
u
i
,
m
(
x
)
q
m
,
where
(14)
u
i
,
m
(
x
)
=
1
m
!
∂
m
U
i
(
x
;
q
)
∂
q
m
|
q
=
0
.
Thus, since U
i
(
x
;
1
)
=
u
i
(
x
) and U
i
(
x
;
0
)
=
u
i
,
0
(
x
), we obtain
(15)
u
i
(
x
)
=
u
i
,
0
(
x
)
+
∑
m
=
1
+
∞
‍
u
i
,
m
(
x
)
.
The series (15) converges when the auxiliary parameter ℏ is carefully chosen. The functions u
i
,
m appearing in series (15) are obtained as solutions of the so-called higher order deformations which are obtained by differentiating the zero-order deformation equation (10), m times with respect to q, then dividing by m
!, and finally setting q
=
0. This gives
(16)
L
[
u
i
,
m
(
x
)
-
(
χ
m
+
ℏ
)
u
i
,
m
-
1
(
x
)
]
=
ℏ
R
i
,
m
-
1
[
u
i
,
0
,
u
i
,
1
,
…
,
u
i
,
m
-
1
]
-
2
(
1
-
χ
m
)
ℏ
d
i
M
u
M
,
where
(17)
R
i
,
m
-
1
[
u
i
,
0
,
u
i
,
1
,
…
,
u
i
,
m
-
1
]
=
1
(
m
-
1
)
!
∂
m
-
1
G
∂
q
m
-
1
,
(18)
χ
m
=
{
0
,
m
⩽
1
,
1
,
m
>
1
.
The initial approximations u
i
,
0
(
x
) are chosen in such a way that
(19)
L
[
u
i
,
0
]
=
2
d
i
M
u
M
,
which, when using the definition of L in (11), can be written as follows:
(20)
F
[
u
i
,
0
,
u
i
,
0
′
,
u
i
,
0
′′
]
-
2
∑
j
=
0
M
-
1
‍
d
i
j
u
j
,
0
=
2
d
i
M
u
M
,
i
=
0,1
,
2
,
…
,
M
-
1
.
Equation (20) to be solved for the initial approximations u
i
,
0 together with higher order deformation equations giving u
i
,
m constitute sequence of linear ordinary differential equations and are solved using the Chebyshev spectral collocation method which is applied independently in the x direction (where x
∈
[
a
,
b
]) using N
+
1 Chebyshev-Gauss-Lobatto points. Consider
(21)
a
=
η
0
<
η
1
<
⋯
<
η
N
=
b
,
defined as
(22)
x
N
-
r
=
(
b
-
a
)
η
r
+
1
2
,
η
r
=
cos
⁡
r
π
N
,
r
=
0,1
,
2
,
…
,
N
.
The derivatives with respect to x are defined is terms of the Chebyshev differentiation matrix as
(23)
d
p
u
i
,
m
d
x
p
|
x
=
x
r
=
(
2
(
b
-
a
)
)
p
∑
s
=
0
N
‍
D
r
,
s
p
u
i
,
m
(
η
s
)
=
D
p
U
i
,
m
,
r
=
0,1
,
2
,
…
,
N
,
where p is the order of the derivative, D
=
(
2
/
(
b
-
a
)
)
[
D
r
,
s
] (r
,
s
=
0,1
,
2
,
…
,
N) with [
D
r
,
s
] being an (
N
+
1
)
×
(
N
+
1
) Chebyshev derivative matrix, and the vector U
i
,
m is defined as
(24)
U
i
,
m
=
[
u
i
,
m
(
η
0
)
,
u
i
,
m
(
η
1
)
,
…
,
u
i
,
m
(
η
N
)
]
t
.Thus, substituting (23) in the equations that give the initial approximations (20), we obtain the following M
(
N
+
1
)
×
M
(
N
+
1
) matrix system:
(25)
[
A
0,0
A
0,1
⋯
A
0
,
M
-
1
A
1,0
A
1,1
⋯
A
1
,
M
-
1
⋮
⋮
⋱
⋮
A
M
-
1,0
A
M
-
1,1
⋯
A
M
-
1
,
M
-
1
]
[
U
0,0
U
1,0
⋮
U
M
-
1,0
]
=
[
2
d
0
,
M
U
M
2
d
1
,
M
U
M
⋮
2
d
M
-
1
,
M
U
M
]
,
where
(26)
A
i
,
i
=
F
[
I
,
D
,
D
2
]
-
2
d
i
,
i
I
,
i
=
0,1
,
…
,
M
-
1
,
A
i
,
j
=
-
2
d
i
,
j
I
,
when
i
≠
j
,
(27)
U
M
=
[
u
M
(
η
0
)
,
u
M
(
η
1
)
,
…
,
u
M
(
η
N
)
]
t
,
and I is the identity matrix of size (
N
+
1
)
×
(
N
+
1
), the superscript t denotes transpose, and the function F
[
I
,
D
,
D
2
] is the coefficient of U
i
,
0 after the spectral method has been applied to the linear function F
[
u
i
,
0
,
u
i
,
0
′
,
u
i
,
0
′′
]. Solving (25) gives the initial approximation u
i
,
0. To obtain the approximate solutions for u
i
,
m (for m
≥
1), the spectral collocation method, with discretisation in the x direction, is applied in a similar manner to the higher order deformation equations (16). This gives the following M
(
N
+
1
)
×
M
(
N
+
1
) matrix system:
(28)
[
A
0,0
A
0,1
⋯
A
0
,
M
-
1
A
1,0
A
1,1
⋯
A
1
,
M
-
1
⋮
⋮
⋱
⋮
A
M
-
1,0
A
M
-
1,1
⋯
A
M
-
1
,
M
-
1
]
[
U
0
,
m
U
1
,
m
⋮
U
M
-
1
,
m
]
=
[
K
0
,
m
-
1
K
1
,
m
-
1
⋮
K
M
-
1
,
m
-
1
]
,
where A
i
,
i and A
i
,
j are as defined in (26) and
(29)
K
i
,
m
-
1
=
(
ℏ
+
χ
m
)
×
[
F
(
U
i
,
m
-
1
,
D
U
i
,
m
-
1
,
D
2
U
i
,
m
-
1
)
-
2
∑
j
=
0
M
-
1
‍
d
i
,
j
U
j
,
m
-
1
]
-
2
(
1
-
χ
m
)
ℏ
d
i
,
M
U
M
+
ℏ
R
i
,
m
-
1
.
In the above equation, R
i
,
m
-
1 is obtained by converting the continuous derivatives in R
i
,
m
-
1 to Chebyshev spectral derivatives.


## 3. Numerical Experiments

To demonstrate the applicability of the proposed Bi-SHAM algorithm as an appropriate tool for solving nonlinear partial differential equations, we apply the proposed algorithm to well-known nonlinear PDEs of the form (1) with exact solutions. In order to determine the level of accuracy of the BI-SHAM approximate solution, at a particular time level, in comparison with the exact solution we report maximum error which is defined by
(30)
E
N
=
max
⁡
r
{
|
u
(
x
r
,
t
)
-
u
~
(
x
r
,
t
)
|
,
:
0
≤
r
≤
N
}
,
where u
~
(
x
r
,
t
) is the solution obtained by (28) and is the u
(
x
r
,
t
) exact solution at the time level t.Example 1.
We consider Fisher’s equation as follows:(31)
∂
u
∂
t
=
∂
2
u
∂
x
2
+
α
u
(
1
-
u
)
,
subject to the initial condition
(32)
u
(
x
,
0
)
=
1
(
1
+
e
α
/
6
x
)
2
,
and exact solution [14]
(33)
u
(
x
,
t
)
=
1
(
1
+
e
α
/
6
x
-
5
α
t
/
6
)
2
,
where α is a constant. Fisher’s equation represents a reactive-diffusive system and is encountered in chemical kinetics and population dynamics applications. For this example, the linear F and nonlinear operator G to be used in the Bi-SHAM algorithm are chosen as follows:
(34)
F
(
u
)
=
u
′′
+
α
u
,
G
(
u
)
=
-
α
u
2
.
Thus, using (17) we obtain
(35)
R
i
,
m
-
1
=
-
α
∑
n
=
0
m
-
1
‍
u
n
,
i
u
m
-
1
-
n
,
i
.
The approximate solution at the (
x
r
,
t
s
) is obtained by solving (28).Example 2.
We consider the generalized Burgers-Fisher’s equation [15] as follows:
(36)
∂
u
∂
t
+
α
u
δ
∂
u
∂
x
=
∂
2
u
∂
x
2
+
β
u
(
1
-
u
δ
)
,
with initial condition
(37)
u
(
x
,
0
)
=
{
1
2
+
1
2
tanh
(
-
α
δ
2
(
δ
+
1
)
x
)
}
1
/
δ
,
and exact solution
(38)
u
(
x
,
t
)
=
{
(
-
α
δ
2
(
δ
+
1
)
[
x
-
(
α
δ
+
1
+
β
(
δ
+
1
)
α
)
t
]
)
1
2
+
1
2
tanh
(
-
α
δ
2
(
δ
+
1
)
[
x
-
(
α
δ
+
1
+
β
(
δ
+
1
)
α
)
t
]
)
}
1
/
δ
,
where α, β, and δ are parameters which, for illustration purposes, are chosen to be one in this paper. In this example, when α
=
β
=
δ
=
1, the linear F and nonlinear operator G to be used in the Bi-SHAM algorithm are chosen as follows:
(39)
F
(
u
)
=
u
′′
+
u
,
G
(
u
)
=
-
u
u
′
-
u
2
.
Thus, using (17) we obtain
(40)
R
i
,
m
-
1
=
-
∑
n
=
0
m
-
1
‍
(
u
n
,
i
u
m
-
1
-
n
,
i
+
u
n
,
i
u
m
-
1
-
n
,
i
′
)
.Example 3.
Consider the Fitzhurg-Nagumo equation as follows:(41)
∂
u
∂
t
=
∂
2
u
∂
x
2
+
u
(
u
-
α
)
(
1
-
u
)
,
with initial condition
(42)
u
(
x
,
0
)
=
1
2
[
1
-
coth
⁡
(
-
x
2
2
)
]
,
and exact solution [16]
(43)
u
(
x
,
t
)
=
1
2
[
1
-
coth
⁡
(
-
x
2
2
+
2
α
-
1
4
t
)
]
,
where α is a parameter. In this example the linear F and nonlinear operator G to be used in the Bi-SHAM algorithm are chosen as follows:
(44)
F
(
u
)
=
u
′′
-
α
u
,
G
(
u
)
=
(
1
+
α
)
u
2
-
u
3
.
Thus, using (17) we obtain
(45)
R
i
,
m
-
1
=
(
1
+
α
)
∑
n
=
0
m
-
1
‍
u
n
,
i
u
m
-
1
-
n
,
i
-
∑
n
=
0
m
-
1
‍
u
m
-
1
-
n
,
i
∑
k
=
0
n
‍
u
k
,
i
u
n
-
k
,
i
.Example 4.
Consider the Burgers-Huxley’s equation as follows:(46)
∂
u
∂
t
+
α
u
δ
u
x
=
∂
2
u
∂
x
2
+
β
u
(
1
-
u
δ
)
(
u
δ
-
γ
)
,
where α
,
β
≥
0 are constant parameters, δ is a positive integer (set to be δ
=
1 in this study), and γ
∈
(
0,1
).The exact solution subject to the initial condition,(47)
u
(
x
,
0
)
=
1
2
-
1
2
tanh
[
β
r
-
α
x
]
,
is reported in [17, 18] as
(48)
u
(
x
,
t
)
=
1
2
-
1
2
tanh
[
β
r
-
α
(
x
-
c
t
)
]
,
where r
=
α
2
+
8
β and c
=
(
(
α
-
r
)
(
2
γ
-
1
)
+
2
α
)
/
4. The general solution of the exact solution (48) was reported in [19, 20].In this example the linearF and nonlinear operator G to be used in the Bi-SHAM algorithm are chosen as follows:
(49)
F
(
u
)
=
u
′′
-
β
γ
u
,
G
(
u
)
=
-
α
u
u
′
+
β
(
1
+
γ
)
u
2
-
β
u
3
.
Thus, using (17) we obtain
(50)
R
i
,
m
-
1
=
β
(
1
+
γ
)
∑
n
=
0
m
-
1
‍
u
n
,
i
u
m
-
1
-
n
,
i
-
α
∑
n
=
0
m
-
1
‍
u
n
,
i
u
m
-
1
-
n
,
i
′
-
β
∑
n
=
0
m
-
1
‍
u
m
-
1
-
n
,
i
∑
k
=
0
n
‍
u
k
,
i
u
n
-
k
,
i
.


## 4. Results and Discussion

In this section we present the numerical solutions of the implementation of the BI-SHAM algorithm on the nonlinear evolution equations as described in the previous section. The number of collocation points in the spacex variable used to generate the results presented here was N
=
10 in all cases. Furthermore, unless otherwise specified, the order (total number of terms of the HAM series) of the HAM series was set to be m
=
10. It was found that sufficient accuracy was achieved using these values in all numerical computations of the examples considered in this paper.Using finite terms of the SHAM series we definemth order approximation at the collocation points x
r and t
s (for r
=
0,1
,
2
,
…
,
N and s
=
0,1
,
2
,
…
,
M) as follows:
(51)
∑
k
=
0
m
‍
∑
r
=
0
N
‍
∑
s
=
0
M
‍
u
m
M
,
N
(
x
r
,
t
s
)
.Assuming thatU
(
x
r
,
t
s
) is the BI-SHAM approximate solution at the collocation (grid) points, the residual error is defined as
(52)
Res
(
u
)
=
N
[
U
(
x
r
,
t
s
;
ℏ
)
]
,
where N is defined as
(53)
N
(
u
)
=
u
t
-
H
(
u
,
u
x
,
u
x
x
)
.The residual error is used in establishing the suitable convergence controlling parameterℏ. A carefully selected ℏ is paramount in obtaining accurate and converging SHAM series solutions. The infinity norm of the residual error at a particular time level, defined as
(54)
E
s
(
ℏ
)
=
∥
N
[
U
(
x
s
,
t
;
ℏ
)
]
∥
∞
,
was used to identify the optimal value of ℏ that gives the best accuracy.In Figures1, 2, 3, and 4 we give illustrations of typical residual error curves that can be used to calculate the optimal value of ℏ for the Fisher, Burgers-Fisher, Fitzhugh-Nagumo, and Burgers-Huxley equations, respectively, when t
=
1. The residual ℏ-curves are plotted using different orders of the BI-SHAM series. The optimal values of ℏ are chosen to be the clearly defined minimum of the residual curve. It can be seen from the figures that the optimal ℏ value lies in the range -
1
<
ℏ
<
-
0.9 for Fisher’s equation, Fitzhugh-Nagumo’s equation, and Burgers-Fisher’s equation. In the case of Burgers-Huxley’s equation, it can be observed from Figure 4 that the optimal ℏ value is near −1.1. We also note that the residual error decreases with an increase in the order of the BI-SHAM series. This denotes convergence of the proposed method. It was also observed that convergence also improves with an increase in M, the number of collocations used in the t-variable. This observation is in accord with an earlier observation made in a related study by [21] where an interpolation based spectral homotopy analysis method was used to solve PDE based unsteady boundary layer flows.Figure 1
Residualℏ-curve for Fisher’s equation at t
=
1.Figure 2
Residualℏ-curve for Burger-Fisher’s equation at t
=
1.Figure 3
Residualℏ-curve for Fitzhugh-Nagumo’s equation at t
=
1.Figure 4
Residualℏ-curve for Fisher’s equation at t
=
1.In Tables1, 2, 3, and 4 we give the maximum errors between the exact and BI-SHAM results (defined using (30)) for the Fisher, Burgers-Fisher, Fitzhugh-Nagumo, and Burgers-Huxley equations, respectively, at selected values of t for different collocation points, M, in the t-variable. It is worth mentioning here that the results in all tables were computed on the space domain x
∈
[
0,1
]. To give a sense of the computational efficiency of the proposed method, the computational time taken to generate the results is also displayed in the tables. The results displayed in Tables 1, 2, 3, and 4 clearly show the accuracy of the proposed method. The accuracy is seen to improve with an increase in the number of collocation points M. It is remarkable to note that accurate results with errors of order up to 1
0
-
10 are obtained using very few collocation points in both the x and t variables M
≤
10,  N
≤
10. This is a clear indication that the BI-SHAM is powerful method that is very appropriate in solving nonlinear PDEs of the type discussed in this investigation. We remark, also, that the BI-SHAM is computationally fast as the desired accurate results are generated in a fraction of a second in all the examples considered in this work.Table 1
Maximum errorsE
N for Fisher’s equation when α
=
1 using ℏ
=
-
0.9.
t
∖
M
4
6
8
10
0.2
5.066
e
-
06
5.066
e
-
06
3.768
e
-
07
4.751
e
-
10
0.4
1.108
e
-
05
1.108
e
-
05
3.515
e
-
07
6.542
e
-
10
0.6
7.782
e
-
06
7.782
e
-
06
5.009
e
-
07
7.509
e
-
10
0.8
1.405
e
-
05
1.414
e
-
05
4.383
e
-
07
5.496
e
-
10
1.0
7.926
e
-
06
7.926
e
-
06
4.112
e
-
07
3.082
e
-
10
1.2
1.244
e
-
05
1.244
e
-
05
4.378
e
-
07
5.628
e
-
10
1.4
1.244
e
-
05
1.252
e
-
05
3.006
e
-
07
7.171
e
-
10
1.6
6.823
e
-
06
6.823
e
-
06
3.782
e
-
07
6.142
e
-
10
1.8
8.171
e
-
06
8.204
e
-
06
2.602
e
-
07
4.406
e
-
10
2.0
1.316
e
-
06
1.316
e
-
06
3.387
e
-
08
4.012
e
-
10
CPU Time (sec)
0.023
0.026
0.039
0.051Table 2
Maximum errorsE
N for Burgers-Fisher’s equation when α
=
β
=
1 and ℏ
=
-
0.9.
t
∖
M
4
6
8
12
0.2
5.594
e
-
05
1.367
e
-
06
3.805
e
-
08
1.679
e
-
10
0.4
6.853
e
-
05
1.700
e
-
06
4.734
e
-
08
2.339
e
-
10
0.6
1.365
e
-
04
1.726
e
-
06
1.196
e
-
08
9.384
e
-
10
0.8
9.929
e
-
05
2.605
e
-
06
5.635
e
-
08
1.031
e
-
09
1.0
2.036
e
-
05
4.324
e
-
07
8.307
e
-
09
1.523
e
-
10
1.2
8.880
e
-
05
2.330
e
-
06
5.040
e
-
08
9.225
e
-
10
1.4
1.091
e
-
04
1.379
e
-
06
6.720
e
-
09
7.497
e
-
10
1.6
4.889
e
-
05
1.213
e
-
06
3.377
e
-
08
1.140
e
-
10
1.8
3.500
e
-
05
8.680
e
-
07
2.417
e
-
08
1.166
e
-
10
2.0
1.300
e
-
05
1.437
e
-
07
2.167
e
-
09
3.737
e
-
11
CPU Time (sec)
0.012
0.024
0.029
0.048Table 3
Maximum errorsE
N for Fitzhurg-Nagumo’s equation when α
=
1 using ℏ
=
-
0.9.
t
∖
M
4
6
8
10
0.2
5.594
e
-
05
1.367
e
-
06
3.805
e
-
08
1.679
e
-
10
0.4
6.853
e
-
05
1.700
e
-
06
4.734
e
-
08
2.339
e
-
10
0.6
1.365
e
-
04
1.726
e
-
06
1.196
e
-
08
9.384
e
-
10
0.8
9.929
e
-
05
2.605
e
-
06
5.635
e
-
08
1.031
e
-
09
1.0
2.036
e
-
05
4.324
e
-
07
8.307
e
-
09
1.523
e
-
10
1.2
8.880
e
-
05
2.330
e
-
06
5.040
e
-
08
9.225
e
-
10
1.4
1.091
e
-
04
1.379
e
-
06
6.720
e
-
09
7.497
e
-
10
1.6
4.889
e
-
05
1.213
e
-
06
3.377
e
-
08
1.140
e
-
10
1.8
3.500
e
-
05
8.680
e
-
07
2.417
e
-
08
1.166
e
-
10
2.0
1.300
e
-
05
1.437
e
-
07
2.167
e
-
09
3.737
e
-
11
CPU Time (sec)
0.012
0.024
0.029
0.048Table 4
Maximum errorsE
N for the Burgers-Huxley equation when α
=
β
=
δ
=
1 and γ
=
0.1 using ℏ
=
-
1.
t
∖
M
4
6
8
10
0.2
9.847
e
-
05
9.148
e
-
07
3.162
e
-
08
2.211
e
-
10
0.4
5.388
e
-
05
1.944
e
-
06
3.336
e
-
08
4.044
e
-
10
0.6
1.209
e
-
04
1.418
e
-
06
2.188
e
-
08
8.455
e
-
10
0.8
1.172
e
-
04
2.522
e
-
06
4.879
e
-
08
8.368
e
-
10
1.0
4.334
e
-
05
8.399
e
-
07
1.319
e
-
08
2.507
e
-
10
1.2
9.546
e
-
05
2.411
e
-
06
5.037
e
-
08
9.155
e
-
10
1.4
1.238
e
-
04
1.729
e
-
06
7.098
e
-
09
7.605
e
-
10
1.6
7.347
e
-
05
1.395
e
-
06
3.821
e
-
08
3.837
e
-
10
1.8
4.307
e
-
05
1.171
e
-
06
2.808
e
-
08
3.283
e
-
10
2.0
2.131
e
-
05
2.944
e
-
07
5.083
e
-
09
4.876
e
-
10
CPU Time (sec)
0.041
0.065
0.099
0.182


## 5. Conclusion

This paper has presented a new variant of the spectral homotopy analysis method for solving general nonlinear evolution partial differential equations. The new method, called bivariate spectral homotopy analysis method (BISHAM), was developed from a combination of the homotopy analysis method algorithm with bivariate Lagrange interpolation and spectral collocation differentiation. The main goal of the current study was to assess the accuracy, applicability, and effectiveness of the proposed method in solving nonlinear partial differential equations. Numerical simulations were conducted on the Fisher equation, Burger-Fisher equation, Fitzhurg-Nagumo, and Burger-Huxley equations. This study has shown that the BISHAM gives very accurate results in a computationally efficient manner. Further evidence from this study is that the BISHAM gives solutions that are uniformly accurate and valid in large intervals of the governing space and time domains. The apparent success of the method can be attributed to the use of the nontrivial linear operators and the spectral collocation method for differentiating. This work contributes to the existing body of literature on homotopy analysis method based tools for solving complicated nonlinear partial differential equations. Further work needs to be done to establish whether the BISHAM can be equally successful in solving higher order nonlinear partial differential equations and coupled systems of two of more equations.



---

*Source: 350529-2014-08-14.xml*