# Approximate Analytical Solutions for Mathematical Model of Tumour Invasion and Metastasis Using Modified Adomian Decomposition and Homotopy Perturbation Methods

Authors: Norhasimah Mahiddin; S. A. Hashim Ali
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

The modified decomposition method (MDM) and homotopy perturbation method (HPM) are applied to obtain the approximate solution of the nonlinear model of tumour invasion and metastasis. The study highlights the significant features of the employed methods and their ability to handle nonlinear partial differential equations. The methods do not need linearization and weak nonlinearity assumptions. Although the main difference between MDM and Adomian decomposition method (ADM) is a slight variation in the definition of the initial condition, modification eliminates massive computation work. The approximate analytical solution obtained by MDM logically contains the solution obtained by HPM. It shows that HPM does not involve the Adomian polynomials when dealing with nonlinear problems.


---

## Body

## 1. Introduction

Over the years, many mathematical models of tumour growth have appeared in literature [1–3]. These problems and phenomena are modeled by partial differential equations (PDE) such as deterministic reaction-diffusion equations which are used to model the spatial spread of tumours both at early growth and later invasive stages [4, 5]. In most cases, these problems do not admit analytical solution. So these equations should be solved using some particular techniques. Chaplain [6] used numerical solution (finite difference method) to solve the above problem. However, this method involved linearization, discretization, and assumption. Therefore, the real problem has to undergo simplification before it can be solved. In recent years, much attention has been devoted to the newly developed methods to construct an analytical solution of equation such as Adomian decomposition method (ADM) [7] and homotopy perturbation method (HPM) [8]. Both methods yield rapidly convergent series solutions for linear and nonlinear equations. The advantages of these methods are that they provide direct scheme for solving the problem, that is, without the need for linearization and discretization. The accuracy of the ADM method was studied extensively by Hashim et al. [9] and compared with other methods [10, 11]. Anderson et al. [12] proposed a modification of the ADM by a slight variation from the standard ADM. The modified method (MDM) was established based on the assumption that the initial function can be divided into two parts and the success of the MDM depends mainly on the proper choice of the parts. In this paper, we present approximate analytical solution of tumour invasion and metastasis model [13] solved by MDM and HPM. The results from both methods are then compared and reveal their capability, effectiveness and convenience. Both methods give successive approximations of high accuracy solution.


## 2. Problem Formulation

Let us consider a system describing the interactions of the tumour cells (denoted byn), extra cellular matrix (ECM, denoted by f), and matrix degrading enzymes (MDE, denoted by m) is given by [13]
(1)
∂
n
∂
t
=
D
n
∇
2
n
-
χ
∇
·
(
n
∇
f
)
,
∂
f
∂
t
=
-
δ
m
f
,
∂
m
∂
t
=
D
m
∇
2
m
+
μ
n
-
λ
m
,
where D
n is the tumour cell random motility coefficient, D
m is the MDE diffusion coefficient, χ is the haptotactic coefficient, and λ, μ, δ are the positive constants.Non-dimensionalise of (1) by setting
(2)
n
~
=
n
n
o
,
f
~
=
f
f
o
,
m
~
=
m
m
o
,
x
~
=
x
L
,
t
~
=
t
τ
,
where n
o is the tumour cell density, f
o is the ECM density, m
o is the MDE concentration, L is the length scale, and τ is the time (τ
=
L
2
/
D, where D is a reference chemical diffusion coefficient). By dropping the tildes for notational convenience, we obtain the scaled system of equations:
(3)
∂
n
∂
t
=
d
n
∇
2
n
-
γ
∇
·
(
n
∇
f
)
,
(4)
∂
f
∂
t
=
-
η
m
f
,
(5)
∂
m
∂
t
=
d
m
∇
2
m
+
ω
n
-
β
m
,
where d
n
=
D
n
/
D, γ
=
χ
f
o
/
D, η
=
τ
m
o
δ, d
m
=
D
m
/
D, ω
=
τ
μ
n
o
/
m
o, and β
=
τ
λ. The initial conditions of each equation are
(6)
n
(
x
,
0
)
=
exp
(
-
x
2
ε
)
,
f
(
x
,
0
)
=
1
-
0.5
exp
(
-
x
2
ε
)
,
m
(
x
,
0
)
=
0.5
exp
(
-
x
2
ε
)
,
where ε is a positive constant.The approximate solutions of (3)–(5) are obtained by integrating each equation once with respect to t and using the initial condition. Hence we obtained
(7)
n
(
x
,
t
)
=
n
(
x
)
+
d
n
∫
0
t
∂
2
n
∂
x
2
d
z
-
γ
∫
0
t
∂
n
∂
x
·
∂
f
∂
x
d
z
-
γ
∫
0
t
n
∂
2
f
∂
x
2
d
z
,
(8)
f
(
x
,
t
)
=
f
(
x
)
-
η
∫
0
t
m
f
d
z
,
(9)
m
(
x
,
t
)
=
m
(
x
)
+
d
m
∫
0
t
∂
2
m
∂
x
2
d
z
+
ω
∫
0
t
n
d
z
-
β
∫
0
t
m
d
z
.
In (7)–(9), we assume n
(
x
)
,
f
(
x
), and m
(
x
) are bounded for all x in J
=
[
0
,
T
], (
T
∈
ℜ
), and |
t
-
τ
|
≤
m
′,  for all 0
≤
t, τ
≤
T. The terms (
∂
2
n
/
∂
x
2
)
,
(
∂
n
/
∂
x
)
·
(
∂
f
/
∂
x
), n
(
∂
2
f
/
∂
x
2
), F
1
(
m
f
)
=
m
f, ∂
2
m
/
∂
x
2, F
2
(
n
)
=
n, and F
3
(
m
)
=
m are Lipschitz continuous with
(10)
|
∂
2
n
∂
x
2
-
∂
2
n
*
∂
x
2
|
≤
L
1
|
n
-
n
*
|
,
|
∂
n
∂
x
·
∂
f
∂
x
-
∂
n
*
∂
x
·
∂
f
*
∂
x
|
≤
L
2
|
n
f
-
n
*
f
*
|
,
|
n
∂
2
f
∂
x
2
-
n
*
∂
2
f
*
∂
x
2
|
≤
L
3
|
n
f
-
n
*
f
*
|
,
|
F
1
(
m
,
f
)
-
F
1
(
m
*
,
f
*
)
|
≤
L
4
|
m
f
-
m
f
*
|
,
|
∂
2
m
∂
x
2
-
∂
2
m
*
∂
x
2
|
≤
L
5
|
m
-
m
*
|
,
|
F
2
(
n
)
-
F
2
(
n
*
)
|
≤
L
6
|
n
-
n
*
|
,
|
F
3
(
m
)
-
F
3
(
m
*
)
|
≤
L
7
|
m
-
m
*
|
,
α
=
T
(
m
′
L
1
+
m
′
L
2
+
m
′
L
3
+
m
′
L
4
+
m
′
L
5
+
m
′
L
6
+
m
′
L
7
)
,
ζ
=
1
-
T
(
1
-
α
)
.


## 3. Mathematical Methods

### 3.1. Adomian Decomposition Method (ADM)

The Adomian decomposition method is applied in (3)–(5):
(11)
L
t
n
=
d
n
∂
2
n
∂
x
2
-
γ
[
∂
n
∂
x
∂
f
∂
x
+
n
∂
2
f
∂
x
2
]
,
(12)
L
t
f
=
-
η
m
f
,
(13)
L
t
m
=
d
m
∂
2
m
∂
x
2
+
ω
n
-
β
m
,
where L
t
=
∂
/
∂
t is integrable differential operator with L
t
-
1
=
∫
0
t
(
·
)
d
t.Operating on both sides of (11)–(13) with the integral operator L
-
1 leads to
(14)
n
(
x
,
t
)
=
n
(
x
,
0
)
+
d
n
L
t
-
1
(
∂
2
n
∂
x
2
)
-
γ
[
L
t
-
1
[
N
1
(
n
,
f
)
]
+
L
t
-
1
[
N
2
(
n
,
f
)
]
]
,
f
(
x
,
t
)
=
f
(
x
,
0
)
-
η
L
t
-
1
[
N
3
(
m
,
f
)
]
,
m
(
x
,
t
)
=
m
(
x
,
0
)
+
L
t
-
1
(
d
m
∂
2
m
∂
x
2
)
+
L
t
-
1
[
ω
n
-
β
m
]
,
where
(15)
N
1
(
n
,
f
)
=
∂
n
∂
x
∂
f
∂
x
,
N
2
(
n
,
f
)
=
n
∂
2
f
∂
x
2
,
N
3
(
m
,
f
)
=
m
f
are the nonlinear terms. The solutions n
(
x
,
t
), f
(
x
,
t
), and m
(
x
,
t
) can be decomposed by an infinite series as follows [7]:
(16)
n
(
x
,
t
)
=
∑
i
=
0
∞
n
i
(
x
,
t
)
,
f
(
x
,
t
)
=
∑
i
=
0
∞
f
i
(
x
,
t
)
,
m
(
x
,
t
)
=
∑
i
=
0
∞
m
i
(
x
,
t
)
,
where n
i
(
x
,
t
), f
i
(
x
,
t
), and m
i
(
x
,
t
) are the components of n
(
x
,
t
), f
(
x
,
t
), and m
(
x
,
t
) that will elegantly be determined. The nonlinear term N
(
x
,
t
) is decomposed by the following infinite series:
(17)
N
k
(
x
,
t
)
=
∑
l
=
0
∞
A
k
l
,
k
=
1,2
,
3
,
where A
k
l is called Adomian’s polynomial and defined by
(18)
A
k
l
=
1
l
!
[
d
l
d
ψ
l
N
k
(
∑
i
=
0
∞
ψ
i
n
i
,
∑
i
=
0
∞
ψ
i
f
i
,
∑
i
=
0
∞
ψ
i
m
i
)
]
ψ
=
0
,
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
i
≥
0
.
From the above consideration, the decomposition method defines the components n
i
(
x
,
t
), f
i
(
x
,
t
), and m
i
(
x
,
t
) for i
≥
0 by the following recursive relationships.Anderson et al. [12] proposed that the construction of the zeroth component of the decomposition series can be defined in a slightly different way. The modified method (MDM) was established based on the assumption that if the zeroth component u
o
=
g and the function g is possible to divide into two parts such as g
1 and g
2, one can formulate the recursive algorithm for u
o and general term u
n
+
1 in a form of the modified recursive scheme as follows:forn
i
(
x
,
t
),
(19)
n
0
=
g
1
,
n
1
=
g
2
+
∫
0
t
[
d
n
∂
2
n
0
∂
x
2
-
γ
{
A
1,0
(
n
,
f
)
+
A
2,0
(
n
,
f
)
}
]
d
τ
,
n
l
+
1
(
x
,
t
)
=
∫
0
t
[
d
n
∂
2
n
l
∂
x
2
-
γ
{
A
1
,
l
(
n
,
f
)
+
A
2
,
l
(
n
,
f
)
}
]
d
τ
,
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
l
≥
1
;forf
i
(
x
,
t
),
(20)
f
0
=
g
1
′
,
f
1
=
g
2
′
-
η
∫
0
t
[
A
3,0
(
m
,
f
)
]
d
τ
,
f
l
+
1
(
x
,
t
)
=
-
η
∫
0
t
[
A
3
,
l
(
m
,
f
)
]
d
τ
,
l
≥
1
;form
i
(
x
,
t
),
(21)
m
0
=
g
1
′′
,
m
1
=
g
2
′′
+
∫
0
t
[
d
m
∂
2
m
l
∂
x
2
+
ω
n
l
-
β
m
l
]
d
τ
,
m
l
+
1
(
x
,
t
)
=
∫
0
t
[
d
m
∂
2
m
l
∂
x
2
+
ω
n
l
-
β
m
l
]
d
τ
,
l
≥
1
.
This type of modification is giving more flexibility to the ADM in order to solve complicated nonlinear differential equations. MDM scheme avoids the unnecessary computation especially in calculation of the Adomian polynomials. The computation of these polynomials will be reduced very considerably by using the MDM.


### 3.2. Homotopy Perturbation Method (HPM)

To solve (3)–(5) with the HPM method, we construct the following homotopy:
(22)
H
1
(
n
,
f
,
p
)
=
(
1
-
p
)
(
∂
n
∂
t
-
∂
n
0
∂
t
)
+
p
(
∂
n
∂
t
-
d
n
∂
2
n
∂
x
2
+
γ
∂
n
∂
x
·
∂
f
∂
x
+
γ
n
∂
2
f
∂
x
2
)
=
0
,
(23)
H
2
(
f
,
m
,
p
)
=
(
1
-
p
)
(
∂
f
∂
t
-
∂
f
0
∂
t
)
+
p
(
∂
f
∂
t
+
η
m
f
)
=
0
,
(24)
H
3
(
m
,
n
,
p
)
=
(
1
-
p
)
(
∂
m
∂
t
-
∂
m
0
∂
t
)
+
p
(
∂
m
∂
t
-
d
m
∂
2
m
∂
x
2
-
ω
n
+
β
m
)
=
0
or
(25)
H
1
(
n
,
f
,
p
)
=
∂
n
∂
t
-
∂
n
0
∂
t
+
p
(
-
d
n
∂
2
n
∂
x
2
+
γ
∂
n
∂
x
·
∂
f
∂
x
+
γ
n
∂
2
f
∂
x
2
+
∂
n
o
∂
t
)
=
0
,
(26)
H
2
(
f
,
m
,
p
)
=
∂
f
∂
t
-
∂
f
0
∂
t
+
p
(
η
m
f
+
∂
f
0
∂
t
)
=
0
,
(27)
H
3
(
m
,
n
,
p
)
=
∂
m
∂
t
-
∂
m
0
∂
t
+
p
(
-
d
m
∂
2
m
∂
x
2
-
ω
n
+
β
m
+
∂
m
0
∂
t
)
=
0
.
In HPM, the solutions of (25)–(28) are expressed as power series in p:
(28)
n
(
x
,
t
)
=
n
o
(
x
,
t
)
+
p
n
1
(
x
,
t
)
+
p
2
n
2
(
x
,
t
)
+
p
3
n
3
(
x
,
t
)
+
⋯
,
f
(
x
,
t
)
=
f
o
(
x
,
t
)
+
p
f
1
(
x
,
t
)
+
p
2
f
2
(
x
,
t
)
+
p
3
f
3
(
x
,
t
)
+
⋯
,
m
(
x
,
t
)
=
m
o
(
x
,
t
)
+
p
m
1
(
x
,
t
)
+
p
2
m
2
(
x
,
t
)
+
p
3
m
3
(
x
,
t
)
+
⋯
,
where p
∈
[
0,1
] is an embedding parameter and n
o, f
o, and m
o are the arbitrary initial approximation satisfying the given initial condition. As p approaches to 1, we obtained
(29)
n
(
x
,
t
)
=
lim
p
→
1
n
=
n
0
+
n
1
+
n
2
+
n
3
+
⋯
=
∑
i
=
0
∞
n
i
,
(30)
f
(
x
,
t
)
=
lim
p
→
1
f
=
f
0
+
f
1
+
f
2
+
f
3
+
⋯
=
∑
i
=
0
∞
f
i
,
(31)
m
(
x
,
t
)
=
lim
p
→
1
m
=
m
0
+
m
1
+
m
2
+
m
3
+
⋯
=
∑
i
=
0
∞
m
i
.
Substituting (29)–(31) into (25),
(32)
∂
∂
t
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
-
∂
n
0
∂
t
+
p
[
-
d
n
∂
2
∂
x
2
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
+
γ
∂
∂
x
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
×
∂
∂
x
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
γ
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
×
∂
2
∂
x
2
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
∂
n
0
∂
t
∂
2
∂
x
2
]
=
0
.
Substituting (30)-(31) into (26),
(33)
∂
∂
t
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
-
∂
f
0
∂
t
+
p
[
∂
f
0
∂
t
η
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
×
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
∂
f
0
∂
t
]
=
0
.
Substituting (29)–(31) into (27),
(34)
∂
∂
t
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
-
∂
m
0
∂
t
+
p
[
-
d
m
∂
2
∂
x
2
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
-
α
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
+
β
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
+
∂
m
0
∂
t
∂
2
∂
x
2
∂
2
∂
x
2
]
=
0
.
Equating the coefficients of the terms in (32)–(34) with the identical powers of p, we obtained the following.From (32),
(35)
p
o
:
∂
n
0
∂
t
-
∂
n
0
∂
t
=
0
,
p
1
:
∂
n
1
∂
t
-
d
n
∂
2
n
0
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
0
∂
x
2
+
∂
n
0
∂
t
=
0
,
p
2
:
∂
n
2
∂
t
-
d
n
∂
2
n
1
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
1
∂
x
+
γ
∂
n
1
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
1
∂
x
2
+
γ
n
1
∂
2
f
0
∂
x
2
=
0
,
p
3
:
∂
n
3
∂
t
-
d
n
∂
2
n
2
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
2
∂
x
+
γ
∂
n
1
∂
x
∂
f
1
∂
x
+
γ
∂
n
2
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
2
∂
x
2
+
γ
n
1
∂
2
f
1
∂
x
2
+
γ
n
2
∂
2
f
0
∂
x
2
=
0
,
p
4
:
∂
n
4
∂
t
-
d
n
∂
2
n
3
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
3
∂
x
+
γ
∂
n
1
∂
x
∂
f
2
∂
x
+
γ
∂
n
2
∂
x
∂
f
1
∂
x
+
γ
∂
n
3
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
3
∂
x
2
+
γ
n
1
∂
2
f
2
∂
x
2
+
γ
n
2
∂
2
f
1
∂
x
2
=
0
.
From (33),
(36)
p
o
:
∂
f
0
∂
t
-
∂
f
0
∂
t
=
0
,
p
1
:
∂
f
1
∂
t
+
η
m
0
f
0
+
∂
f
0
∂
t
=
0
,
p
2
:
∂
f
2
∂
t
+
η
m
0
f
1
+
η
m
1
f
0
=
0
,
p
3
:
∂
f
3
∂
t
+
η
m
0
f
2
+
η
m
1
f
1
+
η
m
2
f
0
=
0
,
p
4
:
∂
f
4
∂
t
+
η
m
0
f
3
+
η
m
1
f
2
+
η
m
2
f
1
+
η
m
3
f
0
=
0
.
From (34),
(37)
p
o
:
∂
m
0
∂
t
-
∂
m
0
∂
t
=
0
,
p
1
:
∂
m
1
∂
t
-
d
m
∂
2
m
0
∂
x
2
-
ω
n
0
+
β
m
0
+
∂
m
0
∂
t
=
0
,
p
2
:
∂
m
2
∂
t
-
d
m
∂
2
m
1
∂
x
2
-
ω
n
1
+
β
m
1
=
0
,
p
3
:
∂
m
3
∂
t
-
d
m
∂
2
m
2
∂
x
2
-
ω
n
2
+
β
m
2
=
0
,
p
4
:
∂
m
4
∂
t
-
d
m
∂
2
m
3
∂
x
2
-
ω
n
3
+
β
m
3
=
0
.


## 3.1. Adomian Decomposition Method (ADM)

The Adomian decomposition method is applied in (3)–(5):
(11)
L
t
n
=
d
n
∂
2
n
∂
x
2
-
γ
[
∂
n
∂
x
∂
f
∂
x
+
n
∂
2
f
∂
x
2
]
,
(12)
L
t
f
=
-
η
m
f
,
(13)
L
t
m
=
d
m
∂
2
m
∂
x
2
+
ω
n
-
β
m
,
where L
t
=
∂
/
∂
t is integrable differential operator with L
t
-
1
=
∫
0
t
(
·
)
d
t.Operating on both sides of (11)–(13) with the integral operator L
-
1 leads to
(14)
n
(
x
,
t
)
=
n
(
x
,
0
)
+
d
n
L
t
-
1
(
∂
2
n
∂
x
2
)
-
γ
[
L
t
-
1
[
N
1
(
n
,
f
)
]
+
L
t
-
1
[
N
2
(
n
,
f
)
]
]
,
f
(
x
,
t
)
=
f
(
x
,
0
)
-
η
L
t
-
1
[
N
3
(
m
,
f
)
]
,
m
(
x
,
t
)
=
m
(
x
,
0
)
+
L
t
-
1
(
d
m
∂
2
m
∂
x
2
)
+
L
t
-
1
[
ω
n
-
β
m
]
,
where
(15)
N
1
(
n
,
f
)
=
∂
n
∂
x
∂
f
∂
x
,
N
2
(
n
,
f
)
=
n
∂
2
f
∂
x
2
,
N
3
(
m
,
f
)
=
m
f
are the nonlinear terms. The solutions n
(
x
,
t
), f
(
x
,
t
), and m
(
x
,
t
) can be decomposed by an infinite series as follows [7]:
(16)
n
(
x
,
t
)
=
∑
i
=
0
∞
n
i
(
x
,
t
)
,
f
(
x
,
t
)
=
∑
i
=
0
∞
f
i
(
x
,
t
)
,
m
(
x
,
t
)
=
∑
i
=
0
∞
m
i
(
x
,
t
)
,
where n
i
(
x
,
t
), f
i
(
x
,
t
), and m
i
(
x
,
t
) are the components of n
(
x
,
t
), f
(
x
,
t
), and m
(
x
,
t
) that will elegantly be determined. The nonlinear term N
(
x
,
t
) is decomposed by the following infinite series:
(17)
N
k
(
x
,
t
)
=
∑
l
=
0
∞
A
k
l
,
k
=
1,2
,
3
,
where A
k
l is called Adomian’s polynomial and defined by
(18)
A
k
l
=
1
l
!
[
d
l
d
ψ
l
N
k
(
∑
i
=
0
∞
ψ
i
n
i
,
∑
i
=
0
∞
ψ
i
f
i
,
∑
i
=
0
∞
ψ
i
m
i
)
]
ψ
=
0
,
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
i
≥
0
.
From the above consideration, the decomposition method defines the components n
i
(
x
,
t
), f
i
(
x
,
t
), and m
i
(
x
,
t
) for i
≥
0 by the following recursive relationships.Anderson et al. [12] proposed that the construction of the zeroth component of the decomposition series can be defined in a slightly different way. The modified method (MDM) was established based on the assumption that if the zeroth component u
o
=
g and the function g is possible to divide into two parts such as g
1 and g
2, one can formulate the recursive algorithm for u
o and general term u
n
+
1 in a form of the modified recursive scheme as follows:forn
i
(
x
,
t
),
(19)
n
0
=
g
1
,
n
1
=
g
2
+
∫
0
t
[
d
n
∂
2
n
0
∂
x
2
-
γ
{
A
1,0
(
n
,
f
)
+
A
2,0
(
n
,
f
)
}
]
d
τ
,
n
l
+
1
(
x
,
t
)
=
∫
0
t
[
d
n
∂
2
n
l
∂
x
2
-
γ
{
A
1
,
l
(
n
,
f
)
+
A
2
,
l
(
n
,
f
)
}
]
d
τ
,
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
l
≥
1
;forf
i
(
x
,
t
),
(20)
f
0
=
g
1
′
,
f
1
=
g
2
′
-
η
∫
0
t
[
A
3,0
(
m
,
f
)
]
d
τ
,
f
l
+
1
(
x
,
t
)
=
-
η
∫
0
t
[
A
3
,
l
(
m
,
f
)
]
d
τ
,
l
≥
1
;form
i
(
x
,
t
),
(21)
m
0
=
g
1
′′
,
m
1
=
g
2
′′
+
∫
0
t
[
d
m
∂
2
m
l
∂
x
2
+
ω
n
l
-
β
m
l
]
d
τ
,
m
l
+
1
(
x
,
t
)
=
∫
0
t
[
d
m
∂
2
m
l
∂
x
2
+
ω
n
l
-
β
m
l
]
d
τ
,
l
≥
1
.
This type of modification is giving more flexibility to the ADM in order to solve complicated nonlinear differential equations. MDM scheme avoids the unnecessary computation especially in calculation of the Adomian polynomials. The computation of these polynomials will be reduced very considerably by using the MDM.


## 3.2. Homotopy Perturbation Method (HPM)

To solve (3)–(5) with the HPM method, we construct the following homotopy:
(22)
H
1
(
n
,
f
,
p
)
=
(
1
-
p
)
(
∂
n
∂
t
-
∂
n
0
∂
t
)
+
p
(
∂
n
∂
t
-
d
n
∂
2
n
∂
x
2
+
γ
∂
n
∂
x
·
∂
f
∂
x
+
γ
n
∂
2
f
∂
x
2
)
=
0
,
(23)
H
2
(
f
,
m
,
p
)
=
(
1
-
p
)
(
∂
f
∂
t
-
∂
f
0
∂
t
)
+
p
(
∂
f
∂
t
+
η
m
f
)
=
0
,
(24)
H
3
(
m
,
n
,
p
)
=
(
1
-
p
)
(
∂
m
∂
t
-
∂
m
0
∂
t
)
+
p
(
∂
m
∂
t
-
d
m
∂
2
m
∂
x
2
-
ω
n
+
β
m
)
=
0
or
(25)
H
1
(
n
,
f
,
p
)
=
∂
n
∂
t
-
∂
n
0
∂
t
+
p
(
-
d
n
∂
2
n
∂
x
2
+
γ
∂
n
∂
x
·
∂
f
∂
x
+
γ
n
∂
2
f
∂
x
2
+
∂
n
o
∂
t
)
=
0
,
(26)
H
2
(
f
,
m
,
p
)
=
∂
f
∂
t
-
∂
f
0
∂
t
+
p
(
η
m
f
+
∂
f
0
∂
t
)
=
0
,
(27)
H
3
(
m
,
n
,
p
)
=
∂
m
∂
t
-
∂
m
0
∂
t
+
p
(
-
d
m
∂
2
m
∂
x
2
-
ω
n
+
β
m
+
∂
m
0
∂
t
)
=
0
.
In HPM, the solutions of (25)–(28) are expressed as power series in p:
(28)
n
(
x
,
t
)
=
n
o
(
x
,
t
)
+
p
n
1
(
x
,
t
)
+
p
2
n
2
(
x
,
t
)
+
p
3
n
3
(
x
,
t
)
+
⋯
,
f
(
x
,
t
)
=
f
o
(
x
,
t
)
+
p
f
1
(
x
,
t
)
+
p
2
f
2
(
x
,
t
)
+
p
3
f
3
(
x
,
t
)
+
⋯
,
m
(
x
,
t
)
=
m
o
(
x
,
t
)
+
p
m
1
(
x
,
t
)
+
p
2
m
2
(
x
,
t
)
+
p
3
m
3
(
x
,
t
)
+
⋯
,
where p
∈
[
0,1
] is an embedding parameter and n
o, f
o, and m
o are the arbitrary initial approximation satisfying the given initial condition. As p approaches to 1, we obtained
(29)
n
(
x
,
t
)
=
lim
p
→
1
n
=
n
0
+
n
1
+
n
2
+
n
3
+
⋯
=
∑
i
=
0
∞
n
i
,
(30)
f
(
x
,
t
)
=
lim
p
→
1
f
=
f
0
+
f
1
+
f
2
+
f
3
+
⋯
=
∑
i
=
0
∞
f
i
,
(31)
m
(
x
,
t
)
=
lim
p
→
1
m
=
m
0
+
m
1
+
m
2
+
m
3
+
⋯
=
∑
i
=
0
∞
m
i
.
Substituting (29)–(31) into (25),
(32)
∂
∂
t
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
-
∂
n
0
∂
t
+
p
[
-
d
n
∂
2
∂
x
2
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
+
γ
∂
∂
x
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
×
∂
∂
x
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
γ
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
×
∂
2
∂
x
2
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
∂
n
0
∂
t
∂
2
∂
x
2
]
=
0
.
Substituting (30)-(31) into (26),
(33)
∂
∂
t
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
-
∂
f
0
∂
t
+
p
[
∂
f
0
∂
t
η
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
×
(
f
0
+
p
f
1
+
p
2
f
2
+
p
3
f
3
+
⋯
)
+
∂
f
0
∂
t
]
=
0
.
Substituting (29)–(31) into (27),
(34)
∂
∂
t
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
-
∂
m
0
∂
t
+
p
[
-
d
m
∂
2
∂
x
2
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
-
α
(
n
0
+
p
n
1
+
p
2
n
2
+
p
3
n
3
+
⋯
)
+
β
(
m
0
+
p
m
1
+
p
2
m
2
+
p
3
m
3
+
⋯
)
+
∂
m
0
∂
t
∂
2
∂
x
2
∂
2
∂
x
2
]
=
0
.
Equating the coefficients of the terms in (32)–(34) with the identical powers of p, we obtained the following.From (32),
(35)
p
o
:
∂
n
0
∂
t
-
∂
n
0
∂
t
=
0
,
p
1
:
∂
n
1
∂
t
-
d
n
∂
2
n
0
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
0
∂
x
2
+
∂
n
0
∂
t
=
0
,
p
2
:
∂
n
2
∂
t
-
d
n
∂
2
n
1
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
1
∂
x
+
γ
∂
n
1
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
1
∂
x
2
+
γ
n
1
∂
2
f
0
∂
x
2
=
0
,
p
3
:
∂
n
3
∂
t
-
d
n
∂
2
n
2
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
2
∂
x
+
γ
∂
n
1
∂
x
∂
f
1
∂
x
+
γ
∂
n
2
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
2
∂
x
2
+
γ
n
1
∂
2
f
1
∂
x
2
+
γ
n
2
∂
2
f
0
∂
x
2
=
0
,
p
4
:
∂
n
4
∂
t
-
d
n
∂
2
n
3
∂
x
2
+
γ
∂
n
0
∂
x
∂
f
3
∂
x
+
γ
∂
n
1
∂
x
∂
f
2
∂
x
+
γ
∂
n
2
∂
x
∂
f
1
∂
x
+
γ
∂
n
3
∂
x
∂
f
0
∂
x
+
γ
n
0
∂
2
f
3
∂
x
2
+
γ
n
1
∂
2
f
2
∂
x
2
+
γ
n
2
∂
2
f
1
∂
x
2
=
0
.
From (33),
(36)
p
o
:
∂
f
0
∂
t
-
∂
f
0
∂
t
=
0
,
p
1
:
∂
f
1
∂
t
+
η
m
0
f
0
+
∂
f
0
∂
t
=
0
,
p
2
:
∂
f
2
∂
t
+
η
m
0
f
1
+
η
m
1
f
0
=
0
,
p
3
:
∂
f
3
∂
t
+
η
m
0
f
2
+
η
m
1
f
1
+
η
m
2
f
0
=
0
,
p
4
:
∂
f
4
∂
t
+
η
m
0
f
3
+
η
m
1
f
2
+
η
m
2
f
1
+
η
m
3
f
0
=
0
.
From (34),
(37)
p
o
:
∂
m
0
∂
t
-
∂
m
0
∂
t
=
0
,
p
1
:
∂
m
1
∂
t
-
d
m
∂
2
m
0
∂
x
2
-
ω
n
0
+
β
m
0
+
∂
m
0
∂
t
=
0
,
p
2
:
∂
m
2
∂
t
-
d
m
∂
2
m
1
∂
x
2
-
ω
n
1
+
β
m
1
=
0
,
p
3
:
∂
m
3
∂
t
-
d
m
∂
2
m
2
∂
x
2
-
ω
n
2
+
β
m
2
=
0
,
p
4
:
∂
m
4
∂
t
-
d
m
∂
2
m
3
∂
x
2
-
ω
n
3
+
β
m
3
=
0
.


## 4. Existence and Convergence of MDM and HPM

Theorem 1.
Let0
<
α
<
1; then (3)–(5) have a unique solution.Proof.
(I) Letn and n
* be two different solutions of (7) then(38)
|
n
-
n
*
|
=
|
d
n
∫
0
t
[
∂
2
n
∂
x
2
-
∂
2
n
*
∂
x
2
]
d
z
-
γ
∫
0
t
(
∂
n
∂
x
·
∂
f
∂
x
-
∂
n
*
∂
x
·
∂
f
*
∂
x
)
d
z
-
γ
∫
0
t
(
n
∂
2
f
∂
x
2
-
n
*
∂
2
f
*
∂
x
2
)
d
z
|
≤
|
d
n
|
∫
0
t
|
[
∂
2
n
∂
x
2
-
∂
2
n
*
∂
x
2
]
|
d
z
+
|
γ
|
∫
0
t
|
∂
n
∂
x
·
∂
f
∂
x
-
∂
n
*
∂
x
·
∂
f
*
∂
x
|
d
z
+
|
γ
|
∫
0
t
|
n
∂
2
f
∂
x
2
-
n
*
∂
2
f
*
∂
x
2
|
d
z
≤
T
(
m
′
L
1
+
m
′
L
2
+
m
′
L
3
)
|
n
-
n
*
|
|
f
-
f
*
|
=
α
|
n
-
n
*
|
,
from which we get (
1
-
α
)
|
n
-
n
*
|
≤
0. Since 0
<
α
<
1, |
n
-
n
*
|
=
0, implies n
=
n
* and completes the proof.
(II) Letf and f
* be two different solutions of (8) then
(39)
|
f
-
f
*
|
=
|
-
η
∫
0
t
(
F
1
(
m
f
)
-
F
1
(
m
*
f
*
)
)
d
z
|
≤
|
η
|
|
∫
0
t
(
F
1
(
m
f
)
-
F
1
(
m
*
f
*
)
)
d
z
|
≤
T
(
m
′
L
4
)
=
α
|
f
-
f
*
|
,
from which we get (
1
-
α
)
|
f
-
f
*
|
≤
0. Since 0
<
α
<
1, |
f
-
f
*
|
=
0, implies f
=
f
* and completes the proof.
(III) Letm and m
* be two different solutions of (9); then
(40)
|
m
-
m
*
|
=
|
d
m
∫
0
t
[
∂
2
m
∂
x
2
-
∂
2
m
*
∂
x
2
]
d
z
+
γ
∫
0
t
(
|
F
2
(
n
)
-
F
2
(
n
*
)
|
)
d
z
-
β
∫
0
t
(
|
F
3
(
m
)
-
F
3
(
m
*
)
|
)
d
z
|
≤
|
d
m
|
∫
0
t
|
[
∂
2
m
∂
x
2
-
∂
2
m
*
∂
x
2
]
|
d
z
+
|
α
|
∫
0
t
|
F
2
(
n
)
-
F
2
(
n
*
)
|
d
z
+
|
β
|
∫
0
t
|
F
4
(
n
)
-
F
4
(
n
*
)
|
d
z
≤
T
(
m
′
L
5
+
m
′
L
6
+
m
′
L
7
)
=
α
|
m
-
m
*
|
;
from which we get (
1
-
α
)
|
m
-
m
*
|
≤
0. Since 0
<
α
<
1, |
m
-
m
*
|
=
0, implies m
=
m
* and completes the proof.Theorem 2.
The series solutionn
(
x
,
t
)
=
∑
i
=
0
∞
n
i
(
x
,
t
), f
(
x
,
t
)
=
∑
i
=
0
∞
f
i
(
x
,
t
), and m
(
x
,
t
)
=
∑
i
=
0
∞
m
i
(
x
,
t
) of (3)–(5), respectively, using MDM converges if 0
<
α
<
1, |
n
1
(
x
,
t
)
|
<
∞, |
f
1
(
x
,
t
)
|
<
∞, and |
m
1
(
x
,
t
)
|
<
∞.Proof.
Denote by(
C
[
J
]
,
∥
·
∥
) the Banach space of all continuous functions on J with the norm ∥
f
(
t
)
∥
=
max
|
f
(
t
)
|
∀
t
∈
J. Define the sequence of partial series {
S
b
}; let S
b and S
a be arbitrary partial sums with b
≥
a. We prove that S
b is a Cauchy sequence in this Banach space.
(I) For (11),
(41)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
S
b
-
S
a
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
n
i
(
x
,
t
)
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
(
∫
0
t
d
n
∂
2
n
i
∂
x
2
d
z
-
γ
∫
0
t
∂
n
i
∂
x
·
∂
f
i
∂
x
d
z
-
γ
∫
0
t
n
∂
2
f
i
∂
x
2
d
z
)
|
=
max
∀
t
∈
J
|
d
n
∫
0
t
(
∑
i
=
k
b
-
1
∂
2
n
i
∂
x
2
)
d
z
-
γ
∫
0
t
(
∑
i
=
k
b
-
1
∂
n
i
∂
x
·
∂
f
i
∂
x
)
d
z
-
γ
∫
0
t
(
∑
i
=
k
b
-
1
n
i
∂
2
f
i
∂
x
2
)
d
z
|
.
From [14], we have
(42)
∑
i
=
k
b
-
1
∂
2
n
i
∂
x
2
=
G
1
2
(
S
b
-
1
)
-
G
1
2
(
S
a
-
1
)
,
∑
i
=
k
b
-
1
∂
n
i
∂
x
·
∂
f
i
∂
x
=
G
2
2
(
S
b
-
1
)
-
G
2
2
(
S
a
-
1
)
,
∑
i
=
k
b
-
1
n
i
∂
2
f
i
∂
x
2
=
G
3
2
(
S
b
-
1
)
-
G
3
2
(
S
a
-
1
)
.
So,
(43)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
d
n
∫
0
t
[
G
1
2
(
S
b
-
1
)
-
G
1
2
(
S
a
-
1
)
]
d
z
-
γ
∫
0
t
[
G
2
2
(
S
b
-
1
)
-
G
2
2
(
S
a
-
1
)
]
d
z
-
γ
∫
0
t
[
G
3
2
(
S
b
-
1
)
-
G
3
2
(
S
a
-
1
)
]
d
z
|
≤
|
d
n
|
∫
0
t
|
G
1
2
(
S
b
-
1
)
-
G
1
2
(
S
a
-
1
)
|
d
z
+
|
γ
|
∫
0
t
|
G
2
2
(
S
b
-
1
)
-
G
2
2
(
S
a
-
1
)
|
d
z
+
|
γ
|
∫
0
t
|
G
3
2
(
S
b
-
1
)
-
G
3
2
(
S
a
-
1
)
|
d
z
≤
α
∥
S
b
-
S
a
∥
.
(II) For (12),
(44)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
S
b
-
S
a
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
f
i
(
x
,
t
)
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
(
-
η
∫
0
t
m
i
f
i
d
z
)
|
=
max
∀
t
∈
J
|
-
η
∫
0
t
(
∑
i
=
k
b
-
1
m
i
f
i
)
d
z
|
.
From [14], we have
(45)
∑
i
=
k
b
-
1
m
i
f
i
=
F
1
(
S
b
-
1
)
-
F
1
(
S
a
-
1
)
.
So,
(46)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
-
η
∫
0
t
[
F
1
(
S
b
-
1
)
-
F
1
(
S
a
-
1
)
]
d
z
|
≤
|
η
|
∫
0
t
|
F
1
(
S
b
-
1
)
-
F
1
(
S
a
-
1
)
|
d
z
≤
α
∥
S
b
-
S
a
∥
.
(III) For (13),
(47)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
S
b
-
S
a
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
m
i
(
x
,
t
)
|
=
max
∀
t
∈
J
|
∑
i
=
k
+
1
b
(
∫
0
t
d
m
∂
2
m
i
∂
x
2
d
z
+
ω
∫
0
t
n
i
d
z
-
β
∫
0
t
m
i
d
z
)
∑
i
=
k
+
1
b
(
∫
0
t
d
m
∂
2
m
i
∂
x
2
d
z
+
ω
∫
0
t
n
i
d
z
|
=
max
∀
t
∈
J
|
d
m
∫
0
t
(
∑
i
=
k
b
-
1
∂
2
m
i
∂
x
2
)
d
z
+
ω
∫
0
t
(
∑
i
=
k
b
-
1
n
i
)
d
z
-
β
∫
0
t
(
∑
i
=
k
b
-
1
m
i
)
d
z
|
.
From [14], we have
(48)
∑
i
=
k
b
-
1
∂
2
m
i
∂
x
2
=
G
4
2
(
S
b
-
1
)
-
G
4
2
(
S
a
-
1
)
,
∑
i
=
k
b
-
1
n
i
=
F
2
(
S
b
-
1
)
-
F
2
(
S
a
-
1
)
,
∑
i
=
k
b
-
1
m
i
=
F
3
(
S
b
-
1
)
-
F
3
(
S
a
-
1
)
.
So,
(49)
∥
S
b
-
S
a
∥
=
max
∀
t
∈
J
|
d
m
∫
0
t
[
G
4
2
(
S
b
-
1
)
-
G
4
2
(
S
a
-
1
)
]
d
z
+
ω
∫
0
t
[
F
2
(
S
b
-
1
)
-
F
2
(
S
a
-
1
)
]
d
z
-
β
∫
0
t
[
F
3
(
S
b
-
1
)
-
F
3
(
S
a
-
1
)
]
d
z
|
≤
|
d
m
|
∫
0
t
|
G
4
2
(
S
b
-
1
)
-
G
4
2
(
S
a
-
1
)
|
d
z
+
|
ω
|
∫
0
t
|
F
2
(
S
b
-
1
)
-
F
2
(
S
a
-
1
)
|
d
z
+
|
β
|
∫
0
t
|
F
3
(
S
b
-
1
)
-
F
3
(
S
a
-
1
)
|
d
z
≤
α
∥
S
b
-
S
a
∥
.
For (43), let b
=
a
+
1; then
(50)
∥
S
a
+
1
-
S
a
∥
≤
α
∥
S
a
-
S
a
-
1
∥
≤
α
2
∥
S
a
-
1
-
S
a
-
2
∥
⋮
≤
α
a
∥
S
1
-
S
0
∥
.
From the triangle inequality, we have
(51)
∥
S
b
-
S
a
∥
≤
∥
S
a
+
1
-
S
a
∥
+
∥
S
a
+
2
-
S
a
+
1
∥
+
⋯
+
∥
S
b
-
S
b
-
1
∥
≤
(
α
a
+
α
a
+
1
+
⋯
+
α
b
-
a
-
1
)
∥
S
1
-
S
0
∥
≤
α
a
(
1
+
α
+
α
2
+
⋯
+
α
b
-
a
-
1
)
∥
S
1
-
S
0
∥
≤
α
a
(
1
-
α
b
-
a
1
-
α
)
∥
n
1
(
x
,
t
)
∥
;
similar steps for (46)
(52)
⋮
≤
α
a
(
1
-
α
b
-
a
1
-
α
)
∥
f
1
(
x
,
t
)
∥
;
similar steps for (49)
(53)
⋮
≤
α
a
(
1
-
α
b
-
a
1
-
α
)
∥
m
1
(
x
,
t
)
∥
.
Since 0
<
α
<
1, we have (
1
-
α
b
-
a
)
<
1; then
(54)
∥
S
b
-
S
a
∥
≤
α
a
1
-
α
max
∀
t
∈
J
|
n
1
(
x
,
t
)
|
,
∥
S
b
-
S
a
∥
≤
α
a
1
-
α
max
∀
t
∈
J
|
f
1
(
x
,
t
)
|
,
∥
S
b
-
S
a
∥
≤
α
a
1
-
α
max
∀
t
∈
J
|
m
1
(
x
,
t
)
|
.
But |
n
1
(
x
,
t
)
,
f
1
(
x
,
t
)
,
m
1
(
x
,
t
)
|
<
∞, so as a
→
∞ then ∥
S
b
-
S
a
∥
→
0. We confide that {
S
b
} is a Cauchy sequence in C
[
J
]; therefore the series converges and the proof is completed.Theorem 3.
If|
n
a
(
x
,
t
)
|
≤
1, |
f
a
(
x
,
t
)
|
≤
1, |
m
a
(
x
,
t
)
|
≤
1, then the series solution n
(
x
,
t
)
=
∑
i
=
0
∞
n
i
(
x
,
t
), f
(
x
,
t
)
=
∑
i
=
0
∞
f
i
(
x
,
t
), and m
(
x
,
t
)
=
∑
i
=
0
∞
m
i
(
x
,
t
) of (3)–(5) converges to the exact solution by using HPM.Proof.
(I) For   (3), we set [14],
(55)
ϕ
b
(
x
,
t
)
=
∑
i
=
1
b
n
i
(
x
,
t
)
,
ϕ
b
+
1
(
x
,
t
)
=
∑
i
=
1
b
+
1
n
i
(
x
,
t
)
.
So,
(56)
|
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
,
t
)
|
=
|
ϕ
b
+
n
b
-
ϕ
b
|
=
|
n
b
|
≤
∑
k
=
0
a
-
1
(
|
d
n
|
∫
0
t
|
∂
2
n
a
-
k
-
1
∂
x
2
|
d
z
+
|
γ
|
∫
0
t
|
∂
n
k
-
a
-
1
∂
x
·
∂
f
k
-
a
-
1
∂
x
|
d
z
+
|
γ
|
∫
0
t
|
n
k
-
a
-
1
∂
2
f
k
-
a
-
1
∂
x
2
|
)
d
z
.
Thus
(57)
∑
b
=
0
∞
∥
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
)
∥
≤
(
a
-
1
)
α
|
f
(
x
)
|
∑
b
=
0
∞
α
b
.
Since 0
<
α
<
1, lim
b
→
∞
n
b
(
x
,
t
)
=
n
(
x
,
t
).
(II) For  (4), we set [14],
(58)
ϕ
b
(
x
,
t
)
=
∑
i
=
1
b
f
i
(
x
,
t
)
,
ϕ
b
+
1
(
x
,
t
)
=
∑
i
=
1
b
+
1
f
i
(
x
,
t
)
.
So,
(59)
|
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
,
t
)
|
=
|
ϕ
b
+
f
b
-
ϕ
b
|
=
|
f
b
|
≤
∑
k
=
0
a
-
1
|
η
|
∫
0
t
|
m
k
-
a
-
1
f
k
-
a
-
1
|
d
z
.
Thus
(60)
∑
b
=
0
∞
∥
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
)
∥
≤
(
a
-
1
)
α
|
f
(
x
)
|
∑
b
=
0
∞
α
b
.
Since 0
<
α
<
1, lim
b
→
∞
f
b
(
x
,
t
)
=
f
(
x
,
t
).
(III) For  (5), we set [14],
(61)
ϕ
b
(
x
,
t
)
=
∑
i
=
1
b
m
i
(
x
,
t
)
,
ϕ
b
+
1
(
x
,
t
)
=
∑
i
=
1
b
+
1
m
i
(
x
,
t
)
.
So,
(62)
|
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
,
t
)
|
=
|
ϕ
b
+
m
b
-
ϕ
b
|
=
|
m
b
|
≤
∑
k
=
0
a
-
1
(
|
d
m
|
∫
0
t
|
∂
2
m
a
-
k
-
1
∂
x
2
|
d
z
+
|
ω
|
∫
0
t
|
n
k
-
a
-
1
|
d
z
+
|
β
|
∫
0
t
|
m
k
-
a
-
1
|
)
d
z
.
Thus
(63)
∑
b
=
0
∞
∥
ϕ
b
+
1
(
x
,
t
)
-
ϕ
b
(
x
)
∥
≤
(
a
-
1
)
α
|
f
(
x
)
|
∑
b
=
0
∞
α
b
.
Since 0
<
α
<
1, lim
b
→
∞
m
b
(
x
,
t
)
=
m
(
x
,
t
).


## 5. Numerical Experiment

In this section, we compute numerically (3)–(5) by the MDM and HPM methods.


### 5.1. MDM

From the ADM formula (18), we can obtain the first three terms of the Adomian polynomials:
(64)
A
1,0
=
N
1
(
n
0
,
f
0
)
=
-
2
x
2
ε
2
e
-
2
x
2
/
ε
,
A
2,0
=
N
2
(
n
0
,
f
0
)
=
e
-
2
x
2
/
ε
ε
(
1
-
2
x
2
ε
)
,
A
3,0
=
N
3
(
m
0
,
f
0
)
=
1
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
.
By the recursive formula in (19)–(21), we can obtain directly the components of n
i, f
i, and m
i.From (22),
(65)
n
o
=
0
,
n
1
=
n
(
x
,
0
)
+
∫
0
t
[
d
n
∂
2
n
0
∂
x
2
-
γ
(
A
10
+
A
20
)
]
d
τ
=
e
-
x
2
/
ε
-
{
2
d
n
[
1
-
2
x
2
ε
]
+
γ
e
-
x
2
/
ε
[
1
-
4
x
2
ε
]
}
t
ε
e
-
x
2
/
ε
,
n
2
=
-
(
{
-
4
d
n
ε
〈
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
+
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
〉
}
+
e
-
x
2
/
ε
〈
(
1
-
4
x
2
ε
)
2
ε
2
γ
μ
x
2
[
e
-
x
2
/
ε
-
1
]
+
4
x
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
-
γ
μ
ε
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
]
-
γ
(
1
-
2
x
2
ε
)
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
〉
)
×
t
2
2
e
-
x
2
/
ε
.
From (23),
(66)
f
o
=
0
,
f
1
=
f
(
x
,
0
)
-
η
∫
0
t
A
3,0
d
τ
=
1
-
1
2
e
-
x
2
/
ε
-
(
1
-
1
2
e
-
x
2
/
ε
)
η
t
2
e
-
x
2
/
ε
,
f
2
=
(
1
-
1
2
e
-
x
2
/
ε
)
×
[
η
4
e
-
x
2
/
ε
-
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
]
η
t
2
2
e
-
x
2
/
ε
.
From (24),
(67)
m
o
=
0
,
m
1
=
∫
0
t
[
d
m
∂
2
m
0
∂
x
2
+
ω
n
0
-
β
m
0
]
d
τ
=
1
2
e
-
x
2
/
ε
-
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
t
e
-
x
2
/
ε
,
m
2
=
-
(
{
d
m
[
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
]
}
+
ω
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
-
β
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
t
2
2
e
-
x
2
/
ε
.


### 5.2. HPM Method

Following the HPM method, we can obtain the first three terms of the polynomials.From (35)–(37),
(68)
n
o
=
e
-
x
2
/
ε
,
n
1
=
∫
0
t
(
d
n
2
ε
e
-
x
2
/
ε
[
1
-
2
x
2
ε
]
+
γ
2
x
2
ε
2
e
-
x
2
/
ε
e
-
x
2
/
ε
-
γ
e
-
x
2
/
ε
e
-
x
2
/
ε
[
1
-
2
x
2
ε
]
)
d
τ
=
-
{
2
d
n
[
1
-
2
x
2
ε
]
+
γ
e
-
x
2
/
ε
[
1
-
4
x
2
ε
]
}
t
ε
e
-
x
2
/
ε
,
n
2
=
∫
0
t
(
(
1
-
2
x
2
ε
)
d
n
4
ε
t
e
-
x
2
/
ε
×
{
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
-
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
}
-
2
ε
γ
x
e
-
x
2
/
ε
μ
ε
t
x
e
-
x
2
/
ε
[
-
1
+
e
-
x
2
/
ε
]
-
4
ε
t
e
-
x
2
/
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
x
e
-
x
2
/
ε
+
γ
e
-
x
2
/
ε
μ
ε
t
e
-
x
2
/
ε
×
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
-
4
x
2
ε
e
-
x
2
/
ε
]
+
γ
t
e
-
x
2
/
ε
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
e
-
x
2
/
ε
×
(
1
-
2
x
2
ε
)
)
d
τ
=
-
(
{
-
4
d
n
ε
〈
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
+
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
〉
}
+
e
-
x
2
/
ε
〈
(
1
-
4
x
2
ε
)
2
ε
2
γ
μ
x
2
[
e
-
x
2
/
ε
-
1
]
+
4
x
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
-
γ
μ
ε
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
]
-
γ
(
1
-
2
x
2
ε
)
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
〉
)
×
t
2
2
e
-
x
2
/
ε
.
From (43),
(69)
f
o
=
1
-
1
2
e
-
x
2
/
ε
,
f
1
=
-
∫
0
t
(
η
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
)
d
τ
=
-
(
1
-
1
2
e
-
x
2
/
ε
)
η
t
2
e
-
x
2
/
ε
,
f
2
=
∫
0
t
(
η
[
1
2
e
-
x
2
/
ε
η
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
t
+
e
-
x
2
/
ε
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
t
×
(
1
-
1
2
e
-
x
2
/
ε
)
]
)
d
τ
=
(
1
-
1
2
e
-
x
2
/
ε
)
×
[
η
4
e
-
x
2
/
ε
-
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
]
η
t
2
2
e
-
x
2
/
ε
.
From (46),
(70)
m
o
=
1
2
e
-
x
2
/
ε
,
m
1
=
-
∫
0
t
e
-
x
2
/
ε
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
d
τ
=
-
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
t
e
-
x
2
/
ε
,
m
2
=
∫
0
t
(
-
d
m
t
e
-
x
2
/
ε
×
{
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
}
-
ω
t
e
-
x
2
/
ε
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
+
β
e
-
x
2
/
ε
t
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
d
τ
,
m
2
=
-
(
{
d
m
[
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
]
}
+
ω
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
-
β
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
×
t
2
2
e
-
x
2
/
ε
.
It is obvious that the first three terms’ approximate solutions (65)–(67) obtained using MDM are the same as the first four terms’ (68)–(70) of the HPM.ADM and HPM provide analytical solution in terms of an infinite power series (see (16) for ADM and (29)–(31) for HPM). The series consists of both positive and negative terms, although not in a regular alternating fashion. The ratio test was applied to the absolute values of the series coefficient. This provides a sufficient condition for convergence of the series for a space interval Δ
X in the form:
(71)
lim
m
→
∞
|
a
m
+
1
a
m
|
<
1
Δ
X
.
However, the approach in this study was to replace (71) with
(72)
lim
m
→
M
|
a
m
+
1
a
m
|
<
1
Δ
X
,
where M is a large constant. Figures 1, 2, and 3 show the behavior of the function f
(
m
)
=
|
a
m
+
1
/
a
m
| for increasing values of m
. It is clear from these figures that the ratio f
(
m
) decays as m increases, obviously indicating that the series is convergent.Figure 1
The ratio convergence test applied to the series coefficients (tumour) for MDM and HPM as a function of the number of terms in series.Figure 2
The ratio convergence test applied to the series coefficients (ECM) for MDM and HPM as a function of the number of terms in series.Figure 3
The ratio convergence test applied to the series coefficients (MDE) for MDM and HPM as a function of the number of terms in series.Figures4, 5, 6, and 7 show four snapshots in time of the tumour cell density, ECM density, and MDE concentration. The ECM profile shows clearly the degradation by the MDEs. As the MDEs degrade the ECM, the tumour cells invade via combination of diffusion and haptotaxis.Figure 4
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
0.Figure 5
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
1.Figure 6
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
10.Figure 7
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
20.The tumour density distribution shows a small cluster of cells built up at the leading edge of the tumour due to haptotactic migration. As time evolves (Figures5–7), this cluster of cells migrates further from the tumour main body and continues to invade the ECM at slower rate.


## 5.1. MDM

From the ADM formula (18), we can obtain the first three terms of the Adomian polynomials:
(64)
A
1,0
=
N
1
(
n
0
,
f
0
)
=
-
2
x
2
ε
2
e
-
2
x
2
/
ε
,
A
2,0
=
N
2
(
n
0
,
f
0
)
=
e
-
2
x
2
/
ε
ε
(
1
-
2
x
2
ε
)
,
A
3,0
=
N
3
(
m
0
,
f
0
)
=
1
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
.
By the recursive formula in (19)–(21), we can obtain directly the components of n
i, f
i, and m
i.From (22),
(65)
n
o
=
0
,
n
1
=
n
(
x
,
0
)
+
∫
0
t
[
d
n
∂
2
n
0
∂
x
2
-
γ
(
A
10
+
A
20
)
]
d
τ
=
e
-
x
2
/
ε
-
{
2
d
n
[
1
-
2
x
2
ε
]
+
γ
e
-
x
2
/
ε
[
1
-
4
x
2
ε
]
}
t
ε
e
-
x
2
/
ε
,
n
2
=
-
(
{
-
4
d
n
ε
〈
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
+
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
〉
}
+
e
-
x
2
/
ε
〈
(
1
-
4
x
2
ε
)
2
ε
2
γ
μ
x
2
[
e
-
x
2
/
ε
-
1
]
+
4
x
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
-
γ
μ
ε
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
]
-
γ
(
1
-
2
x
2
ε
)
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
〉
)
×
t
2
2
e
-
x
2
/
ε
.
From (23),
(66)
f
o
=
0
,
f
1
=
f
(
x
,
0
)
-
η
∫
0
t
A
3,0
d
τ
=
1
-
1
2
e
-
x
2
/
ε
-
(
1
-
1
2
e
-
x
2
/
ε
)
η
t
2
e
-
x
2
/
ε
,
f
2
=
(
1
-
1
2
e
-
x
2
/
ε
)
×
[
η
4
e
-
x
2
/
ε
-
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
]
η
t
2
2
e
-
x
2
/
ε
.
From (24),
(67)
m
o
=
0
,
m
1
=
∫
0
t
[
d
m
∂
2
m
0
∂
x
2
+
ω
n
0
-
β
m
0
]
d
τ
=
1
2
e
-
x
2
/
ε
-
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
t
e
-
x
2
/
ε
,
m
2
=
-
(
{
d
m
[
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
]
}
+
ω
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
-
β
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
t
2
2
e
-
x
2
/
ε
.


## 5.2. HPM Method

Following the HPM method, we can obtain the first three terms of the polynomials.From (35)–(37),
(68)
n
o
=
e
-
x
2
/
ε
,
n
1
=
∫
0
t
(
d
n
2
ε
e
-
x
2
/
ε
[
1
-
2
x
2
ε
]
+
γ
2
x
2
ε
2
e
-
x
2
/
ε
e
-
x
2
/
ε
-
γ
e
-
x
2
/
ε
e
-
x
2
/
ε
[
1
-
2
x
2
ε
]
)
d
τ
=
-
{
2
d
n
[
1
-
2
x
2
ε
]
+
γ
e
-
x
2
/
ε
[
1
-
4
x
2
ε
]
}
t
ε
e
-
x
2
/
ε
,
n
2
=
∫
0
t
(
(
1
-
2
x
2
ε
)
d
n
4
ε
t
e
-
x
2
/
ε
×
{
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
-
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
}
-
2
ε
γ
x
e
-
x
2
/
ε
μ
ε
t
x
e
-
x
2
/
ε
[
-
1
+
e
-
x
2
/
ε
]
-
4
ε
t
e
-
x
2
/
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
x
e
-
x
2
/
ε
+
γ
e
-
x
2
/
ε
μ
ε
t
e
-
x
2
/
ε
×
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
-
4
x
2
ε
e
-
x
2
/
ε
]
+
γ
t
e
-
x
2
/
ε
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
e
-
x
2
/
ε
×
(
1
-
2
x
2
ε
)
)
d
τ
=
-
(
{
-
4
d
n
ε
〈
d
n
ε
[
3
-
6
x
3
ε
-
2
ε
(
3
x
2
-
2
x
5
ε
)
]
+
e
-
x
2
/
ε
[
γ
(
3
-
8
x
3
ε
)
+
3
x
2
-
4
x
4
ε
]
〉
}
+
e
-
x
2
/
ε
〈
(
1
-
4
x
2
ε
)
2
ε
2
γ
μ
x
2
[
e
-
x
2
/
ε
-
1
]
+
4
x
ε
{
d
n
ε
(
3
x
-
2
x
3
ε
)
-
γ
e
-
x
2
/
ε
(
3
x
-
4
x
3
ε
)
}
-
γ
μ
ε
[
-
1
+
2
x
2
ε
+
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
]
-
γ
(
1
-
2
x
2
ε
)
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
〉
)
×
t
2
2
e
-
x
2
/
ε
.
From (43),
(69)
f
o
=
1
-
1
2
e
-
x
2
/
ε
,
f
1
=
-
∫
0
t
(
η
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
)
d
τ
=
-
(
1
-
1
2
e
-
x
2
/
ε
)
η
t
2
e
-
x
2
/
ε
,
f
2
=
∫
0
t
(
η
[
1
2
e
-
x
2
/
ε
η
2
e
-
x
2
/
ε
(
1
-
1
2
e
-
x
2
/
ε
)
t
+
e
-
x
2
/
ε
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
t
×
(
1
-
1
2
e
-
x
2
/
ε
)
]
)
d
τ
=
(
1
-
1
2
e
-
x
2
/
ε
)
×
[
η
4
e
-
x
2
/
ε
-
(
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
)
]
η
t
2
2
e
-
x
2
/
ε
.
From (46),
(70)
m
o
=
1
2
e
-
x
2
/
ε
,
m
1
=
-
∫
0
t
e
-
x
2
/
ε
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
d
τ
=
-
[
d
m
ε
(
1
-
2
x
2
ε
)
-
ω
+
β
2
]
t
e
-
x
2
/
ε
,
m
2
=
∫
0
t
(
-
d
m
t
e
-
x
2
/
ε
×
{
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
}
-
ω
t
e
-
x
2
/
ε
×
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
+
β
e
-
x
2
/
ε
t
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
d
τ
,
m
2
=
-
(
{
d
m
[
-
d
m
〈
2
ε
(
1
-
2
x
2
ε
)
+
4
(
1
-
5
x
2
ε
+
2
x
4
ε
2
)
〉
+
1
ε
(
1
-
2
x
2
ε
)
(
2
ω
-
β
)
]
}
+
ω
{
2
d
n
ε
(
1
-
2
x
2
ε
)
+
γ
e
-
x
2
/
ε
(
1
-
4
x
2
ε
)
}
-
β
[
d
m
(
1
-
2
x
2
)
-
ω
+
β
2
]
)
×
t
2
2
e
-
x
2
/
ε
.
It is obvious that the first three terms’ approximate solutions (65)–(67) obtained using MDM are the same as the first four terms’ (68)–(70) of the HPM.ADM and HPM provide analytical solution in terms of an infinite power series (see (16) for ADM and (29)–(31) for HPM). The series consists of both positive and negative terms, although not in a regular alternating fashion. The ratio test was applied to the absolute values of the series coefficient. This provides a sufficient condition for convergence of the series for a space interval Δ
X in the form:
(71)
lim
m
→
∞
|
a
m
+
1
a
m
|
<
1
Δ
X
.
However, the approach in this study was to replace (71) with
(72)
lim
m
→
M
|
a
m
+
1
a
m
|
<
1
Δ
X
,
where M is a large constant. Figures 1, 2, and 3 show the behavior of the function f
(
m
)
=
|
a
m
+
1
/
a
m
| for increasing values of m
. It is clear from these figures that the ratio f
(
m
) decays as m increases, obviously indicating that the series is convergent.Figure 1
The ratio convergence test applied to the series coefficients (tumour) for MDM and HPM as a function of the number of terms in series.Figure 2
The ratio convergence test applied to the series coefficients (ECM) for MDM and HPM as a function of the number of terms in series.Figure 3
The ratio convergence test applied to the series coefficients (MDE) for MDM and HPM as a function of the number of terms in series.Figures4, 5, 6, and 7 show four snapshots in time of the tumour cell density, ECM density, and MDE concentration. The ECM profile shows clearly the degradation by the MDEs. As the MDEs degrade the ECM, the tumour cells invade via combination of diffusion and haptotaxis.Figure 4
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
0.Figure 5
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
1.Figure 6
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
10.Figure 7
One-dimensional MDM and HPM solution of the system (3)–(5) with constant tumour cell diffusion showing the cell density, MDE concentration, and ECM density at t
=
20.The tumour density distribution shows a small cluster of cells built up at the leading edge of the tumour due to haptotactic migration. As time evolves (Figures5–7), this cluster of cells migrates further from the tumour main body and continues to invade the ECM at slower rate.


## 6. Conclusion

In this paper, the modified decomposition method (MDM) and homotopy perturbation method (HPM) were used to obtain the solutions for the nonlinear model of tumour invasion and metastasis. Although the main difference between MDM and ADM is a slight variation in the definition of the initial conditions, the modification demonstrates reliability and effectiveness in applying the present problem. This method thus eliminates the difficulties and massive computation work. Also it is shown that the obtained solution by MDM logically contains the solution obtained by HPM. The benefits of HPM with respect to MDM are HPM does not involve the Adomian polynomials which is a fundamental qualitative difference in analysis between HPM and MDM.



---

*Source: 654978-2014-01-30.xml*