# A New Reconstruction of Variational Iteration Method and Its Application to Nonlinear Volterra Integrodifferential Equations

Authors: K. Maleknejad; M. Tamamgar
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

We reconstruct the variational iteration method that we call, parametric iteration method (PIM). The purposed method was applied for solving nonlinear Volterra integrodifferential equations (NVIDEs). The solution process is illustrated by some examples. Comparisons are made between PIM and Adomian decomposition method (ADM). Also exact solution of the 3rd example is obtained. The results show the simplicity and efficiency of PIM. Also, the convergence of this method is studied in this work.


---

## Body

## 1. Introduction

It is well known that many events in scientific fields deal with integrodifferential equations. The nonlinear Volterra integrodifferential equations play a major role in many physical processes such as nanohydrodynamic [1], dropwise condensation [2], and biologic [3]. The various numerical methods exist for solving NVIDEs, for example, variational iteration method (VIM), Adomian decomposition method [4, 5], Chebyshev polynomials [6], and Bernstein’s approximation [7]. First, Liao purposed homotopy analysis method [8] and it is applied in many scientific problems [9, 10]; then, VIM was purposed by He [11]. In this paper, we reconstruct the VIM that we call PIM. PIM was applied successfully for solving boundary value problems [12]. We consider nonlinear integrodifferential equations as follows:
(1)
u
(
m
)
(
x
)
=
f
(
x
)
+
λ
∫
0
x
k
(
x
,
t
)
F
(
u
(
t
)
)
d
t
,
a
≤
x
≤
b
,
(2)
u
(
m
)
(
x
)
=
f
(
x
)
+
λ
∫
0
x
k
(
x
,
t
)
F
(
u
,
u
′
)
d
t
,
a
≤
x
≤
b
,
and the initial value for both of the two equations is as follows:
(3)
u
(
i
)
(
x
0
)
=
y
i
,
(
i
=
0,1
,
…
,
m
-
1
)
.In this work, the numerical solution of (1) and (2) is possible by PIM when f,k,u are continuous and F is continuous operator. Parametric iteration method provides solution for NVIDEs as a sequence of iterations. In this study, some examples are given and we solve them using parametric iteration method and compare the obtained results with ADM results. In all these cases, the present technique worked excellently, as it will be shown in this study.


## 2. The Basic Idea of the Parametric Iteration Method

In this section, we describe PIM for solving nonlinear Volterra integrodifferential equations. Then, the local convergence is discussed.


### 2.1. Parametric Iteration Method

The PIM provides the solution for (1) and (2) as a sequence of approximations. This method gives rapidly convergent successive approximations of the exact solution if such a solution exists; otherwise, approximations can be used for numerical purposes. We assume L and N are the linear and nonlinear operators on C
m
[
a
,
b
]. To explain the basic idea of PIM, we consider (1) and (2) as follows:
(4)
L
(
u
)
+
N
(
u
)
=
f
(
x
)
,
where L with the property L
(
g
)
≡
0 when g
≡
0 denotes the so-called auxiliary linear operator with respect to u, N is a nonlinear continuous operator with respect to u, f
(
x
) is the known continuous function, and u
∈
C
m
[
a
,
b
]. The basic essence of this method is to construct a family of iterative processes for (1) and (2) as [13]
(5)
L
[
u
k
+
1
(
x
)
-
u
k
(
x
)
]
=
h
H
(
x
)
A
[
u
k
(
x
)
]
,
with the initial conditions
(6)
u
(
i
)
(
x
0
)
=
y
i
,
(
i
=
0,1
,
…
,
m
-
1
)
,
where
(7)
A
[
u
k
(
x
)
]
=
L
[
(
u
k
(
x
)
]
+
N
[
u
k
(
x
)
]
-
f
(
x
)
=
u
k
(
m
)
-
λ
∫
0
x
k
(
x
,
t
)
u
k
n
d
t
-
f
(
x
)
,
or
(8)
A
[
u
k
(
x
)
]
=
L
[
(
u
k
(
x
)
]
+
N
[
u
k
(
x
)
]
-
f
(
x
)
=
u
k
(
m
)
-
λ
∫
0
x
F
(
x
,
t
,
u
k
,
u
k
′
)
d
t
-
f
(
x
)
,
and u
0
(
x
) is the initial guess which can be chosen arbitrarily, but the suitable selection is positively affect for the rate of convergence [13], or it can also be solved from its corresponding linear homogeneous equation L
[
u
0
(
x
)
]
=
0 or linear nonhomogeneous equation L
[
u
0
(
x
)
]
=
f
(
x
). The parameter h
≠
0 and function H
(
x
)
≠
0 denote the so-called auxiliary parameter and auxiliary function. The selection of h,H
(
x
) was described in [13]. Also, we are free to choose the auxiliary linear operator L, the auxiliary parameter h, the auxiliary function H
(
x
), and the initial approximation u
0
(
x
). Therefore, if the successive approximations u
k
(
x
)
,
k
≥
0 are obtained by PIM in terms of the auxiliary parameter h, then exact solution may be given by u
(
x
)
=
lim
⁡
k
→
∞
⁡
u
k
(
x
). According to [13], Let V
=
{
u
:
u
∈
C
m
[
a
,
b
]
} be the solution space and let {
e
j
(
x
)
:
e
j
(
x
)
∈
V
,
j
=
0,1
,
…
} denote the set of base functions. Hence, we can represent the solution in the series u
(
x
)
=
∑
j
=
0
∞
α
j
e
j
(
x
), where α
j is a coefficient belonging to real numbers. As long as the set of base functions is determined, the auxiliary linear operator L, the initial approximation u
0
(
x
), and the auxiliary function H
(
x
) must be chosen in such a way that all solutions of the corresponding PIM equations (4) exist and it can be expressed by this set of base functions. Now, in order to avoid expensive computational works for solving (1) and (2) via PIM, it is straightforward to use the following set of base functions:
(9)
{
(
x
-
a
)
j
∣
j
=
0,1
,
…
}
;
that is,
(10)
u
(
x
)
=
∑
j
=
0
∞
α
j
(
x
-
a
)
j
,
where α
j
∈
R are unknown coefficients to be determined and a is a constant belonging to real numbers. Now, we set the auxiliary operator L as follows:
(11)
L
[
u
(
x
)
]
=
u
(
m
)
(
x
)
.
The initial guess is to form combination of m-terms of (9); that is,
(12)
u
0
(
x
)
=
α
0
+
α
1
(
x
-
a
)
+
α
2
(
x
-
a
)
2
+
⋯
+
α
j
(
x
-
a
)
j
.According to (11) and the initial conditions (3) and with due attention to L
[
u
0
(
x
)
]
=
f
(
x
), the coefficients α
0
,
α
1
,
α
2
,
…
,
α
m will be determined. Also, we set H
(
x
)
=
1. The selecting of H
(
x
) is arbitrary, but the suitable selection depends on the base functions for solution [13], and we use the PIM processes to compute the approximation solutions of (1) and (2).


### 2.2. The Valid Region ofh

Assume that we gain a family of solution series in terms of the auxiliary parameterh by means of PIM. We consider this solution as a function in terms of h,x; then, we derive (once or more) this function with respect to x in x
=
β that β
∈
[
a
,
b
]; that is, let U
=
G
(
x
,
h
) be the solution of (1) or (2); then, we set
(13)
Ω
=
∂
i
G
∂
x
i
|
x
=
β
,
β
∈
[
a
,
b
]
,
(
i
=
1,2
,
…
)
,
therefore, Ω will be in terms of h; now we plot Ω curve, and according to these h curves, it is easy to discover the valid region of h, which corresponds to the line segments nearly parallel to the horizontal axis. This region is called valid region of h which we denote by R
h. We ensure that the solution series converge for any h
∈
R
h.


### 2.3. Analysis of Convergence of the Parametric Iteration Formula

In this section, we study the local convergence of approximate solution provided by PIM for solving (1).The convergence of approximate solution for (2) is similar to (1).Initially, letu
(
i
)
(
0
)
=
0
,
(
i
=
0,1
,
…
,
m
-
1
) and set L
[
u
(
x
)
]
=
u
(
m
)
(
x
); therefore, we have from (5) the following parametric iteration formula:
(14)
u
k
+
1
(
x
)
=
(
1
+
h
)
u
k
(
x
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1
[
g
(
t
)
+
λ
∫
0
t
k
(
t
,
s
)
F
(
u
k
(
s
)
)
d
s
]
d
t
.The iterative formula (14) expressed by sequence makes a recurrence sequence {
u
k
(
x
)
}. Obviously, the limit of the sequence will be the solution of (1) if the sequence is convergent.In order to prove that the sequence{
u
k
(
x
)
} is convergent, we construct a series:
(15)
u
0
(
x
)
+
[
u
1
(
x
)
-
u
0
(
x
)
]
+
⋯
+
[
u
k
(
x
)
-
u
k
-
1
(
x
)
]
+
⋯
.
Noticing that
(16)
s
k
+
1
=
u
0
(
x
)
+
[
u
1
(
x
)
-
u
0
(
x
)
]
+
⋯
+
[
u
k
(
x
)
-
u
k
-
1
(
x
)
]
=
u
k
(
x
)
,
the sequence {
u
k
(
x
)
} will be convergent if the series is convergent.Theorem 1.
IfF
(
u
(
t
)
) is Lipschitz-continuous in [
a
,
b
] and g
(
x
)
∈
C
[
a
,
b
] and |
λ
|
≤
1
/
M
N where M,N are positive real numbers, then the series of (15) is convergent; that is, the sequence {
u
k
(
x
)
} is convergent for x
∈
[
a
,
b
].Proof.
According to (14), note that
(17)
|
u
1
(
x
)
-
u
0
(
x
)
|
=
|
h
[
[
g
(
t
)
+
λ
∫
0
t
k
(
t
,
s
)
F
(
u
0
(
s
)
)
d
s
]
d
t
u
0
(
x
)
-
1
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
g
(
t
)
+
λ

∫
0
t
k
(
t
,
s
)
F
(
u
0
(
s
)
)
d
s
]

d
t
]
|
≤
|
h
|
[
L
1
+
1
(
m
-
1
)
!
(
L
2
L
3
b
+
L
2
L
4
2
N
b
2
)
]
=
|
h
|
r
,
where
(18)
r
:
=
(
L
1
+
1
(
m
-
1
)
!
)
(
L
2
L
3
b
+
L
2
L
4
2
N
b
2
)
,
M
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
k
(
x
,
t
)
|
,
L
1
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
u
0
(
t
)
|
,
L
2
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
(
x
-
t
)
m
-
1
|
,
L
3
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
g
(
t
)
|
,
L
4
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
F
(
u
0
(
t
)
)
|
.
From (14) and (17) and the assumption that |
F
(
u
k
+
1
)
-
F
(
u
k
)
|
≤
N
|
u
k
+
1
-
u
k
| where N denotes the Lipschitz constant of F
(
u
(
t
)
), it follows that
(19)
|
u
2
-
u
1
|
=
|
[
(
1
+
h
)
(
u
1
-
u
0
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
λ

∫
0
t
k
(
t
,
s
)
(
F
(
u
1
)
-
F
(
u
0
)
)
d
s
]

d
t
]
|
≤
|
|
1
+
h
|
|
u
1
-
u
0
|
+
|
h
|
(
m
-
1
)
!
×

∫
0
x
(
x
-
t
)
(
m
-
1
)
[
λ
N
∫
0
t
k
(
t
,
s
)
|
u
1
-
u
0
|
d
s
]
d
t
|
≤
|
h
|
r
[
|
1
+
h
|
+
L
2
|
h
|
2
(
m
-
1
)
!
b
2
]
=
|
h
|
r
∑
n
=
0
1
(
1
n
)
|
1
+
h
|
1
-
n
(
L
2
|
h
|
2
(
m
-
1
)
!
b
2
)
n
,
(20)
|
u
3
-
u
2
|
=
|
[
(
1
+
h
)
(
u
2
-
u
1
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
λ

∫
0
t
k
(
t
,
s
)
(
F
(
u
2
)
-
F
(
u
1
)
)
d
s
]

d
t
]
|
≤
|
|
1
+
h
|
|
u
2
-
u
1
|
+
|
h
|
(
m
-
1
)
!
×

∫
0
x
(
x
-
t
)
(
m
-
1
)
[
λ
N
∫
0
t
k
(
t
,
s
)
|
u
2
-
u
1
|
d
s
]
d
t
|
≤
|
h
|
r
[
|
1
+
h
|
2
+
2
L
2
|
h
|
|
1
+
h
|
2
(
m
-
1
)
!
b
2
+
L
2
2
|
h
|
2
(
2
(
m
-
1
)
!
)
2
b
4
]
=
|
h
|
r
∑
n
=
0
2
(
2
n
)
|
1
+
h
|
1
-
n
(
L
2
|
h
|
2
(
m
-
1
)
!
b
2
)
n
⋮
(21)
|
u
k
+
1
-
u
k
|
≤
(
|
h
|
r
)
∑
n
=
0
k
(
k
n
)
|
1
+
h
|
k
-
n
(
L
2
|
h
|
b
2
2
(
m
-
1
)
!
)
n
.
In view of (21), the convergence of the series (15) can be concluded for the solution domain x
>
0 and |
1
+
h
|
<
1 with the help of some mathematical software. Therefore, the series of (15) is absolute convergence; that is, the sequence {
u
k
(
x
)
} is convergent for x
∈
[
a
,
b
].


## 2.1. Parametric Iteration Method

The PIM provides the solution for (1) and (2) as a sequence of approximations. This method gives rapidly convergent successive approximations of the exact solution if such a solution exists; otherwise, approximations can be used for numerical purposes. We assume L and N are the linear and nonlinear operators on C
m
[
a
,
b
]. To explain the basic idea of PIM, we consider (1) and (2) as follows:
(4)
L
(
u
)
+
N
(
u
)
=
f
(
x
)
,
where L with the property L
(
g
)
≡
0 when g
≡
0 denotes the so-called auxiliary linear operator with respect to u, N is a nonlinear continuous operator with respect to u, f
(
x
) is the known continuous function, and u
∈
C
m
[
a
,
b
]. The basic essence of this method is to construct a family of iterative processes for (1) and (2) as [13]
(5)
L
[
u
k
+
1
(
x
)
-
u
k
(
x
)
]
=
h
H
(
x
)
A
[
u
k
(
x
)
]
,
with the initial conditions
(6)
u
(
i
)
(
x
0
)
=
y
i
,
(
i
=
0,1
,
…
,
m
-
1
)
,
where
(7)
A
[
u
k
(
x
)
]
=
L
[
(
u
k
(
x
)
]
+
N
[
u
k
(
x
)
]
-
f
(
x
)
=
u
k
(
m
)
-
λ
∫
0
x
k
(
x
,
t
)
u
k
n
d
t
-
f
(
x
)
,
or
(8)
A
[
u
k
(
x
)
]
=
L
[
(
u
k
(
x
)
]
+
N
[
u
k
(
x
)
]
-
f
(
x
)
=
u
k
(
m
)
-
λ
∫
0
x
F
(
x
,
t
,
u
k
,
u
k
′
)
d
t
-
f
(
x
)
,
and u
0
(
x
) is the initial guess which can be chosen arbitrarily, but the suitable selection is positively affect for the rate of convergence [13], or it can also be solved from its corresponding linear homogeneous equation L
[
u
0
(
x
)
]
=
0 or linear nonhomogeneous equation L
[
u
0
(
x
)
]
=
f
(
x
). The parameter h
≠
0 and function H
(
x
)
≠
0 denote the so-called auxiliary parameter and auxiliary function. The selection of h,H
(
x
) was described in [13]. Also, we are free to choose the auxiliary linear operator L, the auxiliary parameter h, the auxiliary function H
(
x
), and the initial approximation u
0
(
x
). Therefore, if the successive approximations u
k
(
x
)
,
k
≥
0 are obtained by PIM in terms of the auxiliary parameter h, then exact solution may be given by u
(
x
)
=
lim
⁡
k
→
∞
⁡
u
k
(
x
). According to [13], Let V
=
{
u
:
u
∈
C
m
[
a
,
b
]
} be the solution space and let {
e
j
(
x
)
:
e
j
(
x
)
∈
V
,
j
=
0,1
,
…
} denote the set of base functions. Hence, we can represent the solution in the series u
(
x
)
=
∑
j
=
0
∞
α
j
e
j
(
x
), where α
j is a coefficient belonging to real numbers. As long as the set of base functions is determined, the auxiliary linear operator L, the initial approximation u
0
(
x
), and the auxiliary function H
(
x
) must be chosen in such a way that all solutions of the corresponding PIM equations (4) exist and it can be expressed by this set of base functions. Now, in order to avoid expensive computational works for solving (1) and (2) via PIM, it is straightforward to use the following set of base functions:
(9)
{
(
x
-
a
)
j
∣
j
=
0,1
,
…
}
;
that is,
(10)
u
(
x
)
=
∑
j
=
0
∞
α
j
(
x
-
a
)
j
,
where α
j
∈
R are unknown coefficients to be determined and a is a constant belonging to real numbers. Now, we set the auxiliary operator L as follows:
(11)
L
[
u
(
x
)
]
=
u
(
m
)
(
x
)
.
The initial guess is to form combination of m-terms of (9); that is,
(12)
u
0
(
x
)
=
α
0
+
α
1
(
x
-
a
)
+
α
2
(
x
-
a
)
2
+
⋯
+
α
j
(
x
-
a
)
j
.According to (11) and the initial conditions (3) and with due attention to L
[
u
0
(
x
)
]
=
f
(
x
), the coefficients α
0
,
α
1
,
α
2
,
…
,
α
m will be determined. Also, we set H
(
x
)
=
1. The selecting of H
(
x
) is arbitrary, but the suitable selection depends on the base functions for solution [13], and we use the PIM processes to compute the approximation solutions of (1) and (2).


## 2.2. The Valid Region ofh

Assume that we gain a family of solution series in terms of the auxiliary parameterh by means of PIM. We consider this solution as a function in terms of h,x; then, we derive (once or more) this function with respect to x in x
=
β that β
∈
[
a
,
b
]; that is, let U
=
G
(
x
,
h
) be the solution of (1) or (2); then, we set
(13)
Ω
=
∂
i
G
∂
x
i
|
x
=
β
,
β
∈
[
a
,
b
]
,
(
i
=
1,2
,
…
)
,
therefore, Ω will be in terms of h; now we plot Ω curve, and according to these h curves, it is easy to discover the valid region of h, which corresponds to the line segments nearly parallel to the horizontal axis. This region is called valid region of h which we denote by R
h. We ensure that the solution series converge for any h
∈
R
h.


## 2.3. Analysis of Convergence of the Parametric Iteration Formula

In this section, we study the local convergence of approximate solution provided by PIM for solving (1).The convergence of approximate solution for (2) is similar to (1).Initially, letu
(
i
)
(
0
)
=
0
,
(
i
=
0,1
,
…
,
m
-
1
) and set L
[
u
(
x
)
]
=
u
(
m
)
(
x
); therefore, we have from (5) the following parametric iteration formula:
(14)
u
k
+
1
(
x
)
=
(
1
+
h
)
u
k
(
x
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1
[
g
(
t
)
+
λ
∫
0
t
k
(
t
,
s
)
F
(
u
k
(
s
)
)
d
s
]
d
t
.The iterative formula (14) expressed by sequence makes a recurrence sequence {
u
k
(
x
)
}. Obviously, the limit of the sequence will be the solution of (1) if the sequence is convergent.In order to prove that the sequence{
u
k
(
x
)
} is convergent, we construct a series:
(15)
u
0
(
x
)
+
[
u
1
(
x
)
-
u
0
(
x
)
]
+
⋯
+
[
u
k
(
x
)
-
u
k
-
1
(
x
)
]
+
⋯
.
Noticing that
(16)
s
k
+
1
=
u
0
(
x
)
+
[
u
1
(
x
)
-
u
0
(
x
)
]
+
⋯
+
[
u
k
(
x
)
-
u
k
-
1
(
x
)
]
=
u
k
(
x
)
,
the sequence {
u
k
(
x
)
} will be convergent if the series is convergent.Theorem 1.
IfF
(
u
(
t
)
) is Lipschitz-continuous in [
a
,
b
] and g
(
x
)
∈
C
[
a
,
b
] and |
λ
|
≤
1
/
M
N where M,N are positive real numbers, then the series of (15) is convergent; that is, the sequence {
u
k
(
x
)
} is convergent for x
∈
[
a
,
b
].Proof.
According to (14), note that
(17)
|
u
1
(
x
)
-
u
0
(
x
)
|
=
|
h
[
[
g
(
t
)
+
λ
∫
0
t
k
(
t
,
s
)
F
(
u
0
(
s
)
)
d
s
]
d
t
u
0
(
x
)
-
1
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
g
(
t
)
+
λ

∫
0
t
k
(
t
,
s
)
F
(
u
0
(
s
)
)
d
s
]

d
t
]
|
≤
|
h
|
[
L
1
+
1
(
m
-
1
)
!
(
L
2
L
3
b
+
L
2
L
4
2
N
b
2
)
]
=
|
h
|
r
,
where
(18)
r
:
=
(
L
1
+
1
(
m
-
1
)
!
)
(
L
2
L
3
b
+
L
2
L
4
2
N
b
2
)
,
M
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
k
(
x
,
t
)
|
,
L
1
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
u
0
(
t
)
|
,
L
2
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
(
x
-
t
)
m
-
1
|
,
L
3
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
g
(
t
)
|
,
L
4
=
max
⁡
a
≤
t
≤
x
≤
b
⁡
|
F
(
u
0
(
t
)
)
|
.
From (14) and (17) and the assumption that |
F
(
u
k
+
1
)
-
F
(
u
k
)
|
≤
N
|
u
k
+
1
-
u
k
| where N denotes the Lipschitz constant of F
(
u
(
t
)
), it follows that
(19)
|
u
2
-
u
1
|
=
|
[
(
1
+
h
)
(
u
1
-
u
0
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
λ

∫
0
t
k
(
t
,
s
)
(
F
(
u
1
)
-
F
(
u
0
)
)
d
s
]

d
t
]
|
≤
|
|
1
+
h
|
|
u
1
-
u
0
|
+
|
h
|
(
m
-
1
)
!
×

∫
0
x
(
x
-
t
)
(
m
-
1
)
[
λ
N
∫
0
t
k
(
t
,
s
)
|
u
1
-
u
0
|
d
s
]
d
t
|
≤
|
h
|
r
[
|
1
+
h
|
+
L
2
|
h
|
2
(
m
-
1
)
!
b
2
]
=
|
h
|
r
∑
n
=
0
1
(
1
n
)
|
1
+
h
|
1
-
n
(
L
2
|
h
|
2
(
m
-
1
)
!
b
2
)
n
,
(20)
|
u
3
-
u
2
|
=
|
[
(
1
+
h
)
(
u
2
-
u
1
)
-
h
(
m
-
1
)
!
×
∫
0
x
(
x
-
t
)
m
-
1

[
λ

∫
0
t
k
(
t
,
s
)
(
F
(
u
2
)
-
F
(
u
1
)
)
d
s
]

d
t
]
|
≤
|
|
1
+
h
|
|
u
2
-
u
1
|
+
|
h
|
(
m
-
1
)
!
×

∫
0
x
(
x
-
t
)
(
m
-
1
)
[
λ
N
∫
0
t
k
(
t
,
s
)
|
u
2
-
u
1
|
d
s
]
d
t
|
≤
|
h
|
r
[
|
1
+
h
|
2
+
2
L
2
|
h
|
|
1
+
h
|
2
(
m
-
1
)
!
b
2
+
L
2
2
|
h
|
2
(
2
(
m
-
1
)
!
)
2
b
4
]
=
|
h
|
r
∑
n
=
0
2
(
2
n
)
|
1
+
h
|
1
-
n
(
L
2
|
h
|
2
(
m
-
1
)
!
b
2
)
n
⋮
(21)
|
u
k
+
1
-
u
k
|
≤
(
|
h
|
r
)
∑
n
=
0
k
(
k
n
)
|
1
+
h
|
k
-
n
(
L
2
|
h
|
b
2
2
(
m
-
1
)
!
)
n
.
In view of (21), the convergence of the series (15) can be concluded for the solution domain x
>
0 and |
1
+
h
|
<
1 with the help of some mathematical software. Therefore, the series of (15) is absolute convergence; that is, the sequence {
u
k
(
x
)
} is convergent for x
∈
[
a
,
b
].


## 3. Illustrative Examples

Now, we use PIM to solve two examples of the kind of (1) and (2) and compare the obtained results with ADM [5] to show the efficiency of PIM.Example 1.
The first example is a nonlinear Volterra integrodifferential equation of the second kind as follows:(22)
u
′
(
x
)
=
-
1
+
∫
0
x
u
2
(
t
)
d
t
,
0
≤
x
≤
1
u
(
0
)
=
0
.According to PIM proceeding, we define(23)
L
[
u
(
x
)
]
=
u
′
(
x
)
,
N
[
u
(
x
)
]
=
∫
0
x
u
2
(
t
)
d
t
,
f
(
x
)
=
-
1
.
Then, we have from (10) that u
0
(
x
)
=
α
0
+
α
1
x. Using initial condition and L
[
u
0
(
x
)
]
=
f
(
x
) gives us, that α
0
=
0,α
1
=
-
1that is,u
0
(
x
)
=
-
x. Now, If we set H
(
x
)
=
1, then we obtain from (5) and (8) that
(24)
u
k
+
1
′
(
x
)
-
u
k
′
(
x
)
=
h
(
u
k
′
(
x
)
-
∫
0
x
u
k
2
(
t
)
d
t
+
1
)
.
Thus we integrate from both sides of (25); then the PIM equations are as follows:
(25)
u
k
+
1
(
x
)
=
u
k
(
x
)
+
h
∫
0
x
[
(
u
k
′
(
t
)
-
∫
0
t
u
k
2
(
s
)
d
s
+
1
)
]
d
x
,
(
k
=
0,1
,
…
)
.
Some of the iterations obtained from (25) are as follows and the other iterations have also been calculated by Maple 13:
(26)
u
1
(
x
)
=
-
x
+
h
(
-
1
12
x
4
)
,
u
2
(
x
)
=
-
x
-
1
12
h
x
4
+
h
(
-
1
12960
h
2
x
10

-
1
252
h
x
7

+
1
4
(
-
1
3
h
-
1
3
)

x
4
)

.
⋮
The obtained result for the 3rd iteration was shown in Table 1; also the valid region of h that is R
h was presented in Figure 1.Table 1
The results of Example1 for u
3
(
x
) with h
=
-
1.
x
ADM
PIM
0.0000
0.000000000
0.0000000
0.0938
−0.0937935
−0.0937935
0.2188
−0.2186090
−0.2186091
0.3125
−0.3117060
−0.3117064
0.4062
−0.4039390
−0.4039385
0.5000
−0.4948230
−0.4948225
0.6250
−0.6124310
−0.6124306
0.7188
−0.6969410
−0.6969414
0.8125
−0.7770900
−0.7770900
0.9062
−0.8519340
−08519338
1.0000
−0.9204760
−0.9204746Figure 1
The valid region ofh. Example 1 shows -
1.2
≤
h
≤
-
0.8.Example 2.
We consider the nonlinear Volterra integrodifferential equation of the second kind as follows:(27)
u
′
(
x
)
=
1
+
∫
0
x
u
(
t
)
u
′
(
t
)
d
t
,
0
≤
x
≤
1
,
(28)
u
(
0
)
=
0
.
According to PIM procedure we set
(29)
L
[
u
(
x
)
]
=
u
′
(
x
)
,
N
[
u
(
x
)
]
=
∫
0
x
u
(
t
)
u
′
(
t
)
d
t
,
f
(
x
)
=
1
.
Then, we have from (10) u
0
(
x
)
=
α
0
+
α
1
x, and (29) gives us that α
0
=
0,α
1
=
1; that is, u
0
(
x
)
=
x. Now similar to Example 1, the iteration scheme is as follows:
(30)
u
k
+
1
(
x
)
=
u
k
(
x
)
+
h
∫
0
x
[
(
u
k
′
(
t
)
-
∫
0
t
u
k
(
s
)
u
k
′
(
s
)
d
s
-
1
)
]
d
x
,
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
(
k
=
0,1
,
…
)
.
Some of the iterations obtained from (30) are as follows:
(31)
u
1
(
x
)
=
x
-
1
6
h
x
3
,
u
2
(
x
)
=
x
-
1
6
h
x
3
+
h
(
-
1
504
h
2
x
7
+
1
30
h
x
5
+
1
3
(
-
1
2
h
-
1
2
)
x
3
)
.
⋮The results of Example2 are available in Table 2. R
h for (27) is presented in Figure 2.Table 2
The results of Example2 for u
3
(
x
) with h
=
-
1.
x
ADM
PIM
0.0000
0.0000000
0.0000000
0.0938
0.0938065
0.0939377
0.2188
0.2189910
0.2205626
0.3125
0.3132980
0.3176876
0.4062
0.4084910
0.4177517
0.5000
0.5053030
0.5219304
0.6250
0.6381770
0.6691415
0.7188
0.7422990
0.7878390
0.8125
0.8518530
0.9155129
0.9062
0.9691440
1.0546355
1.0000
1.0973700
1.2083812Figure 2
The valid region ofh. Example 2 shows -
1.2
≤
h
≤
-
0.8.Example 3.
We consider the nonlinear Volterra integrodifferential equation of the second kind as follows:
(32)
u
′
(
x
)
=
1
-
x
2
+
x
e
-
x
2
2
+
∫
0
x
x
t
e
-
u
2
(
t
)
d
t
,
0
≤
x
≤
1
,
(33)
u
(
0
)
=
0
.
Similar to Examples 1 and 2
(34)
L
[
u
(
x
)
]
=
u
′
(
x
)
,
(35)
N
[
u
(
x
)
]
=
∫
0
x
x
t
e
-
u
2
(
t
)
d
t
,
f
(
x
)
=
1
-
x
2
+
x
e
-
x
2
2
.Now, we consider the initial solution asu
0
(
x
)
=
α
0
+
α
1
x, and (33) and (34) give us that α
0
=
0,α
1
=
1; that is, u
0
(
x
)
=
x. According to PIM iterative formula for this example we have
(36)
u
k
+
1
(
x
)
=
(
1
+
h
)
u
k
(
x
)
+
h
[
∫
0
x
∫
0
t
t
s
e
-
u
k
2
(
s
)
d
s
)
1
4
+
x
-
1
4
x
2
-
1
4
e
x
2
a
a
a
+
(
∫
0
x
∫
0
t
t
s
e
-
u
k
2
(
s
)
d
s
)
]
d
t
aaaaaaaaaaaaaaaa
(
k
=
0,1
,
…
)
.Starting withk
=
0 and initial solution that is u
0
(
x
)
=
x, the exact solution of this example, which is u
(
x
)
=
x, is achieved. The valid value of parameter for (36) is h
=
-
1.


## 4. Results

In this section, we present the results of Examples1 and 2 in two tables and plot the h-curve to determine R
h. All the computations have been done with Maple 13.


## 5. Conclusion

In this paper, we reconstruct the VIM that we call parametric iteration method, and PIM was applied to solve the nonlinear Volterra integrodifferential equations. In order to illustrate the method, we solve three examples. PIM results compared to ADM show that the former is easier in practice and more accurate for NVIDEs. For the 3rd example exact solution was achieved. Further, the convergence of PIM for solving NVIDEs in the valid region ofh
(
R
h
) was presented. Additionally, if we increase the number of iterations by PIM scheme, it seems that the results will have more accuracy in solutions.



---

*Source: 968242-2014-04-28.xml*