# Approximate Method for Solving the Linear Fuzzy Delay Differential Equations

Authors: S. Narayanamoorthy; T. L. Yookesh
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.


---

## Body

## 1. Introduction

Fuzzy set theory is a powerful tool for modeling uncertainty and for processing vague or subjective information in mathematical models, which has been applied to a wide variety of real problems. Thus the theory of fuzzy differential equation has attracted widespread attention and has been rapidly growing. It is massively studied by many researchers [1, 2]. The theory of fuzzy differential equations has undergone a rapid evolution in the last three decades because the idea of fuzzy set theory is simple and natural. The concept of fuzzy was first introduced by Zadeh [3]. Chang and Zadeh [4] had introduced many concepts in fuzzy derivatives. Fuzzy delay differential equations have a wide range of applications in real time applications of control theory, physics, ecology, economics, population study, inventory control, and the theory of nuclear reactors. It is difficult to obtain exact solutions of fuzzy differential equations and hence several numerical methods were proposed [5–8]. Abbasbandy and Allahviranloo [9] developed numerical algorithms for solving fuzzy differential equations based on Seikkala’s derivative [10]. Jafari et al. [11] worked on the solving nth order fuzzy differential equations by the variational iteration method. Allahviranloo et al. [12] used the predictor-corrector method to find the numerical solution of fuzzy differential equations. Delay differential equations are the type of differential equations in which the derivative of the unknown function at a certain time is given in terms of the values of the function at a previous time.Delay differential equations and ordinary differential equations are used to describe physical phenomena, but they are different. While in ordinary differential equations the derivatives of unknown functions are dependent only on the current value of the independent variable, in delay differential equations the derivatives of unknown functions are dependent on the values of the functions at previous time. This implies that the solution of delay differential equations requires the knowledge of the current state and also the certain previous time state. For example, the present state of change of unknown functions depends upon the past values of the same functions in both physical and biological systems.Linear differential equations with retarded argument concept proposed by Myškis (1951) [13] and later many researchers continued to work on these concepts [14, 15]. Driver [15] wrote a book about ordinary differential equations and delay differential equations which explains the equations clearly. Bellen and Zennaro [16] presented the numerical solutions to delay differential equations. Khastan et al. [17] discussed the concepts of fuzzy delay differential equations under the generalized differentiability. Barzinji et al. [18] studied the linear fuzzy delay differential systems to analyze the stability of steady state. For solving the delay differential equations Ibrahim et al. [19] used the 2
-
h step spline method. Evans and Raslan [20] solved delay differential equation by the domain decomposition method. Shakeri and Dehghan [21] found the solution to delay differential equation by the homotopy perturbation method. Mirzaee and Latifi [22] used the differential transform method to the delay differential equation. For the delay differential equation Sadehgi Hafshejani et al. [23] discussed the Legendre Wavelet method. Numerical and theoretical treatment for both linear and nonlinear delay differential equations using the variational iteration method was proposed by Khader [24]. Guerrini worked on delay differential AK model with nonpositive population growth rate [25] and the time delay effects on the qualitative behavior of an economic growth model [26]. Akgül and Kiliçman [27] solved delay differential equations by an accurate method with interpolation. Abdul Aziz et al. [28] derived delay differential equations of small and vanishing lag using the multistep block method. The general form of the delay differential equation is given as follows:(1)
y
′
t
=
f
t
,
y
t
,
y
t
-
r
1
,
…
,
y
n
t
-
r
i
,
t
≥
t
0
,
y
t
=
ϕ
t
,
t
≥
t
0
,where r
i is constant for each i
=
1,2
,
3
,
…
,
n.Let us consider the fuzzy delay differential equation as follows:(2)
y
′
_
t
=
f
t
,
y
_
t
,
y
_
t
-
r
1
,
…
,
y
n
_
t
-
r
i
,
t
≥
t
0
,
y
_
t
=
ϕ
t
,
t
≥
t
0
,
y
′
¯
t
=
f
t
,
y
¯
t
,
y
¯
t
-
r
1
,
…
,
y
n
¯
t
-
r
i
,
t
≥
t
0
,
y
¯
t
=
ϕ
t
,
t
≥
t
0
,where r
i is constant for each i
=
1,2
,
3
,
…
,
n.The Adomian decomposition method is named after Adomian [29]. The Adomian decomposition method is well suited to solve Cauchy problems. The advantage of the method is that it can be applied directly for all types of differential and integral equations, linear or nonlinear, homogeneous or inhomogeneous, and with constant coefficients or with variable coefficients. Another important advantage is that the method is capable of greatly reducing the size of computational work while still maintaining high accuracy of the numerical solution. This method is based on the decomposition of a solution of a nonlinear operator equation in a series of functions. Each of the series is obtained from an expansion of an analytic function into an abstract formulation, but the difficulty arises in calculating the polynomial and in proving the convergence in the series of functions. The Adomian decomposition method is used to solve a wide range of physical problems in various engineering fields such as wave and heat and mass transfer equations. Thus, many researchers have applied and solved their problems by using Adomian decomposition method.Motivated by the work of Evans and Raslan [20], in this paper, the author proposes an approximate method to solve the linear fuzzy delay differential equations using Adomian decomposition method. The purpose of this paper is to find how this technique works on delay differential equations under fuzzy environment. The Adomian decomposition method converges rapidly to form the exact solution. This method does not involve any discretization of variables and hence it is free from rounding off errors. We illustrate a numerical example to explain the proposed method.


## 2. Preliminaries

In this section, we present the most basic notations and definitions, which are used throughout this work. We start with defining a membership function.Definition 1 (see [30]).
LetX be a nonempty set. A fuzzy set A
¯
∈
X is characterized by its membership function μ
A
¯
:
X
→
[
0,1
] and μ
A
¯
(
x
) is interpreted as the degree of membership of element x in fuzzy set A
¯ for each x
∈
X. It is clear that A
¯ is determined by the set of tuples A
¯
=
(
x
,
μ
A
¯
(
x
)
)
∣
x
∈
X
.Definition 2.
A fuzzy number is a mapu
:
R
→
I
=
[
0,1
] which satisfies the following three conditions: (i)
uis upper semicontinuous.
(ii)
u
(
x
)
=
0 outside some interval [
c
,
d
]
⊂
R.
(iii)
There exist real numbersa
,
b such that c
≤
a
≤
b
≤
d,where (1)
u
(
x
) is monotonic increasing on [
c
,
d
],
(2)
u
(
x
) is monotonic decreasing on [
b
,
d
],
(3)
u
(
x
)
=
1
,
a
≤
x
≤
b
. The set of all such fuzzy numbers is represented by E
′.Definition 3.
Given a fuzzy setA
- defined on X and a number α
∈
[
0,1
], the α-cut, A
-
α, and the strong α-cut, A
-
α
+, are the crisp sets (3)
A
-
α
=
x
∣
A
x
≥
α
,
A
-
α
+
=
x
∣
A
x
>
α
.Unlike in the conventional set theory, convexity of fuzzy sets refers to properties of the membership function rather than to the support of a fuzzy set.Definition 4.
An arbitrary fuzzy number is parametric form represented by an ordered pair of functions(
u
_
(
α
)
,
u
¯
(
α
)
)
,
0
≤
α
≤
1, which satisfy the following requirements: (1)
u
_
(
α
) is a bounded left continuous nondecreasing function over [
0,1
],
(2)
u
¯
(
α
) is a bounded left continuous nonincreasing function over [
0,1
],
(3)
u
_
(
α
)
≤
u
¯
(
α
)
,
0
≤
α
≤
1. For arbitrary u
(
α
)
=
(
u
_
(
α
)
,
u
¯
(
α
)
), v
(
α
)
=
(
v
_
(
α
)
,
v
¯
(
α
)
) and scalar k, we define addition (
(
u
¯
)
+
(
v
¯
)
), subtracting by k as(1)
Addition:(4)
u
+
v
_
α
=
u
_
α
+
v
_
α
,
u
+
v
¯
α
=
u
¯
α
+
v
¯
α
,
(2)
Subtraction:(5)
u
-
v
_
α
=
u
_
α
-
v
_
α
,
u
-
v
¯
α
=
u
¯
α
-
v
¯
α
,
(3)
Scalar multiplication:(6)
k
x
=
k
u
_
α
,
k
u
¯
α
,
k
≥
0
,
k
u
¯
α
,
k
u
_
α
,
k
<
0
.Definition 5.
A fuzzy functionf
(
x
) is a fuzzy set on y with membership function (7)
μ
f
x
y
=
μ
f
x
,
y
.Its inverse f
-
1
(
y
) is a fuzzy set on x with (8)
μ
f
-
1
y
=
μ
f
x
,
y
.Definition 6.
Suppose thatf
:
[
c
,
d
]
→
F. For each partition p
=
x
0
,
x
1
,
…
,
x
n of [
c
,
d
] and for arbitrary points ξ
i
,
x
i
-
1
≤
ξ
i
≤
x
i, let (9)
R
p
=
∑
i
=
1
n
f
ξ
i
Δ
i
,where Δ
=
x
i
-
x
i
-
1
. Then the definite integral ∫
c
d
‍
f
(
r
)
d
r of f over [
c
,
d
] is defined by (10)
∫
c
d
f
x
d
x
=
lim
p
→
0
⁡
R
p
,provide the limits exist.Definition 7.
A fuzzy setA
- is the triangular fuzzy number with peak (or center) a, left width α
>
0 and right β
>
0 (Figure 1) if its membership function has the following form: (11)
μ
x
=
1
-
a
-
x
α
if
a
-
α
<
x
<
a
,
1
-
x
-
a
β
if
a
<
x
<
a
+
β
,
0
otherwise
.Figure 1
Triangular fuzzy number.Definition 8.
LetG be an analytical function ∑
u
n a convergent series in E. The Adomian polynomials are defined by (12)
A
k
=
1
k
!
d
k
d
λ
k
G
∑
n
=
0
∞
u
n
λ
n
λ
=
0
.Definition 9.
Letx
,
y
∈
R
F. If there exists z
∈
R
f such that x
=
y
+
z, then z is called the Hukuhara difference of x, y and it is denoted by x
⊖
y.


## 3. Fuzzy Delay Differential Equation

In this section, we refine fuzzy initial value problem [9] for delay differential equation using Sekkiala derivatives [10] as follows: (13)
y
′
x
=
f
x
,
y
x
,
y
x
-
t
,
t
∈
x
0
,
X
,
y
x
0
=
y
0
,where y is a fuzzy function of x
,
f
(
x
,
y
,
y
(
x
-
t
)
) is a fuzzy function of the crisp variable x, and y
(
x
0
)
=
y
0 is a triangular shaped fuzzy number; therefore we have a fuzzy Cauchy problem.We denote the fuzzy functiony
=
[
y
_
,
y
¯
]. It means the α-level set of y
(
x
) for x
∈
[
x
0
,
X
] is (14)
y
x
0
α
=
y
_
x
0
;
α
,
y
¯
x
0
;
α
,
y
x
α
=
y
_
x
;
α
,
y
¯
x
;
α
,
y
x
-
t
α
=
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
,
α
∈
0,1
.By using the extension principle of Zadeh, we have the membership function (15)
f
x
,
y
x
s
=
sup
⁡
y
x
τ
s
=
f
x
,
τ
x
∈
R
,
f
x
,
y
x
-
t
s
=
sup
⁡
y
x
-
t
τ
s
=
f
x
-
t
,
τ
x
-
t
∈
Rso f
(
x
,
y
(
x
)
,
y
(
x
-
t
)
) is a fuzzy number. From this it follows that (16)
f
x
,
y
x
,
y
x
-
t
α
=
f
1
x
,
y
x
,
y
x
-
t
;
α
f
2
x
,
y
x
,
y
x
-
t
;
α
,
α
∈
0,1
,where (17)
f
1
x
,
y
x
,
y
x
-
t
;
α
=
min
⁡
f
x
,
u
u
∈
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
,
f
2
x
,
y
x
,
y
x
-
t
;
α
=
max
⁡
f
x
,
u
u
∈
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
;we define (18)
F
x
,
y
x
,
y
x
-
t
;
α
=
F
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
,
G
x
,
y
x
,
y
x
-
t
;
α
=
G
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
.Theorem 10 (see [10]).
Letf satisfy (19)
f
x
,
v
-
f
x
,
v
¯
≤
g
x
,
v
-
v
¯
,
x
≥
0
,
v
,
v
¯
∈
R
,where g
:
R
+
×
R
+
→
R
+ is a continuous mapping such that α
→
g
(
x
,
α
) is nondecreasing and the initial value problem (20)
u
′
t
=
g
x
,
u
x
,
u
0
=
0
,has the solution on R
+ for u
0
>
0 and that u
(
t
)
=
0 is the only solution of (20) for u
0
=
0
. Then the fuzzy initial value problem (13) has a unique solution.


## 4. Analysis of the Method

Consider the differential equation written in the following form:(21)
L
y
+
N
y
=
g
x
,where L is linear operator, N is a nonlinear operator, and g
(
x
) is a nonhomogeneous term. If differential equations are described by M order, where the differential operation L is given by [31] (22)
L
·
=
d
M
·
d
x
M
,and the inverse operator L
-
1 is therefore considered as M-fold integral operator defined by (23)
L
-
1
∗
=
∫
0
x
∫
0
x
⋯
∫
0
x
∗
d
x
⋯
d
x
︸
M
,then (24)
y
=
L
-
1
∗
g
x
-
N
y
.The Adomian’s method consists of approximating the solution of (24) as an infinite series(25)
y
=
∑
n
=
0
∞
y
n
xand decomposing the nonlinear operator N as (26)
N
y
=
∑
n
=
0
∞
A
n
,where A
n are Adomian polynomials of y
0
,
y
1
,
…
,
y
n given by(27)
A
n
=
1
n
d
n
d
μ
n
N
∑
i
=
0
∞
μ
i
y
i
μ
=
0
n
=
0,1
,
2
,
… substituting the derivatives (25), (26), and (27) in (24) it yields(28)
∑
i
=
0
∞
y
n
x
=
L
-
1
g
x
-
L
-
1
∑
n
=
0
∞
A
n
.Thus, we can identify (29)
y
0
=
L
-
1
g
x
,
y
n
+
1
=
L
-
1
∑
n
=
0
∞
A
n
=
A
n
y
0
,
y
1
,
…
,
y
n
,where n
=
0,1
,
2
,
…
. We then define the K-term approximate to the solution y by (30)
Φ
K
y
=
∑
n
=
0
K
y
n
,
lim
K
→
∞
⁡
Φ
K
y
=
y
.Practical formula for the calculation of Adomian decomposition polynomials is given in A
n. However all terms of the series cannot be determined usually by using A
n
=
∑
i
=
0
∞ approximated with truncated series Φ
k
=
y
0
+
y
1
+
⋯
+
y
n
-
1 as the above result (30).


## 5. The Algorithm of Approximate Solution and Its Applications

Analysis of the method is discussed in Section4. The algorithm of fuzzy delay differential equation under Adomian decomposition method is presented in Section 5.1.


### 5.1. Approximate Solutions of Fuzzy Delay Differential Equations by Applying the Adomian Decomposition Method

Consider the DDE [20, 31, 32] (31)
y
x
=
f
x
,
y
x
,
y
x
-
t
,
0
≤
x
≤
1with initial conditions (32)
y
i
0
=
y
_
0
i
;
y
¯
0
i
,
i
=
0,1
,
2
,
…
,
N
-
1
y
x
=
ϕ
x
,
x
≤
0
.Let Y
=
[
Y
1
,
Y
2
] be the exact solution and let y
=
[
y
1
,
y
2
] be the approximate solution of the given equation (33)
Y
x
α
=
Y
1
x
,
x
-
t
;
α
,
Y
2
x
,
x
-
t
;
α
,
y
x
α
=
y
1
x
,
x
-
t
;
α
,
y
2
x
,
x
-
t
;
α
,keeping argument the value of α fixed; then the exact and approximate solution of x
n are represented by (34)
Y
x
α
=
Y
1
x
,
x
-
t
;
α
,
Y
2
x
,
x
-
t
;
α
,
y
x
α
=
y
1
x
,
x
-
t
;
α
,
y
2
x
,
x
-
t
;
α
,
0
≤
n
≤
N
.Now, the approximate solution is solved by the proposed Adomian decomposition method. We arrive at the following equation:(35)
L
y
_
x
;
α
=
f
x
,
y
_
x
,
y
_
x
-
t
;
α
,
0
≤
x
≤
1
,
L
y
¯
x
;
α
=
f
x
,
y
¯
x
,
y
¯
x
-
t
;
α
,
0
≤
x
≤
1
,where L
(
·
)
=
d
N
(
·
)
/
d
x
N is the differential operator. Operating on both sides of the above equation with the inverse operator (namely, L
-
1
(
∗
)
=
∫
‍
∫
‍
⋯
∫
‍
(
∗
)
d
x
d
x
⋯
d
x
) on using the given initial conditions, we have (36)
L
-
1
·
=
∫
x
0
·
N
t
i
m
e
s
d
xtherefore in operating with L
-
1 on (35) and we have(37)
y
_
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
i
+
L
-
1
f
x
,
y
_
x
,
y
_
x
-
t
,
(38)
y
¯
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
i
+
L
-
1
f
x
,
y
¯
x
,
y
¯
x
-
t
, where α
i is constant initial condition. In Adomain decomposition method, it is assumed that the unknown functions y
(
x
) can be expressed by an infinite series of the form (39)
y
_
x
=
∑
n
=
0
∞
y
_
n
x
,
(40)
y
¯
x
=
∑
n
=
0
∞
y
¯
n
x
;by these components, y
_
n
(
x
) and y
¯
n
(
x
) are determined.The nonlinear termsf
(
x
,
y
_
(
x
)
,
y
_
(
x
-
t
)
)
;
f
(
x
,
y
¯
(
x
)
,
y
¯
(
x
-
t
)
) are defined by the Adomian polynomials as (41)
f
x
,
y
_
x
,
y
_
x
-
t
=
∑
n
=
0
∞
A
n
,
(42)
f
x
,
y
¯
x
,
y
¯
x
-
t
=
∑
n
=
0
∞
B
n
,where A
n and B
n are Adomian polynomials that can be generated for all forms of non linearity [
36
] as(43)
A
n
=
1
n
!
d
n
d
μ
n
f
x
,
∑
i
=
0
∞
μ
i
y
i
_
x
,
∑
i
=
0
∞
μ
i
y
i
_
x
-
t
μ
=
0
,
B
n
=
1
n
!
d
n
d
δ
n
f
x
,
∑
i
=
0
∞
δ
i
y
i
¯
x
,
∑
i
=
0
∞
δ
i
y
i
¯
x
-
t
δ
=
0
,on substituting (39) and (41) in (37) and (40) and (42) in (38), we have (44)
∑
n
=
0
∞
y
_
n
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
∑
n
=
0
∞
A
n
;
∑
n
=
0
∞
y
¯
n
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
∑
n
=
0
∞
B
nto determine the components y
_
n
(
x
;
α
)
;
y
¯
n
(
x
;
α
)
,
n
≥
0. We need to find the y
_
0
(
x
;
α
) and y
¯
0
(
x
;
α
) zero component first by all terms that arise from the initial conditions at x
=
0 and from integrating the source term if it exists. Second, the remaining components of y
_
n
(
x
;
α
)
;
y
¯
n
(
x
;
α
) can be determined in a way such that each component is determined by using the preceding components. In other words, the method introduces the recursive relation (45)
y
_
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
_
n
+
1
x
;
α
=
L
-
1
A
n
,
n
≥
0
(46)
y
¯
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
¯
n
+
1
x
;
α
=
L
-
1
B
n
,
n
≥
0
,for the determination of the components y
_
n
(
x
;
α
); y
¯
n
(
x
;
α
)
,
n
≥
0 of y
¯
(
x
;
α
); y
¯
(
x
;
α
), the series solution of y
_
(
x
); y
¯
(
x
;
α
) follows immediately with the constant α
j, j
=
0,1
,
2
,
…
,
N
-
1 are as yet undetermined. The solution of the fuzzy delay differential equation in form (33) can be determined by the series (37) and (38) with the iterations (45) and (46).Define(47)
F
x
,
y
x
,
y
x
-
t
;
α
=
F
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
,
G
x
,
y
x
,
y
x
-
t
;
α
=
G
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
. The exact and approximate solutions at x
n, 0
≤
n
≤
N are denoted by [
Y
(
x
n
)
]
α
=
[
Y
1
(
(
x
n
)
;
α
)
,
Y
2
(
(
x
n
)
;
α
)
] and [
y
(
x
n
)
]
α
=
[
y
1
(
(
x
n
)
;
α
)
,
y
2
(
(
x
n
)
;
α
)
], respectively. By (33) and (45), (46) we have(48)
Y
1
x
n
+
1
;
α
≈
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
F
∑
n
=
0
∞
A
n
;
Y
2
x
n
+
1
;
α
≈
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
G
∑
n
=
0
∞
B
n
.We define(49)
y
1
x
n
+
1
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
F
∑
n
=
0
∞
A
n
;
y
2
x
n
+
1
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
G
∑
n
=
0
∞
B
n
.The following lemmas will be applied to show convergence of these approximates. That is,(50)
lim
n
→
0
⁡
y
1
x
;
α
=
Y
1
x
;
r
,
lim
n
→
0
⁡
y
2
x
;
α
=
Y
2
x
;
r
.Lemma 11 (see [5]).
Let the sequence of numbers{
W
n
}
n
=
0
N satisfy (51)
W
n
+
1
≤
A
W
n
+
B
,
0
≤
n
≤
N
-
1
,for some given positive constants A and B. Then (52)
W
n
≤
A
n
W
0
+
B
A
n
-
1
A
-
1
,
0
≤
n
≤
N
.Lemma 12 (see [5]).
Let the sequence of numbers{
W
n
}
n
=
0
N, {
V
n
}
n
=
0
N satisfy (53)
W
n
+
1
≤
A
W
n
+
A
max
⁡
W
n
,
V
n
+
B
,
V
n
+
1
≤
A
V
n
+
A
max
⁡
W
n
,
V
n
+
B
,for some given positive constants A and B, and denote (54)
U
n
=
W
n
+
V
n
,
0
≤
n
≤
N
.Then (55)
U
n
=
A
¯
n
U
0
+
B
¯
A
¯
n
-
1
A
¯
-
1
,
0
≤
n
≤
N
,where A
¯
=
1
+
2
A and B
¯
=
2
A.Proof.
LetF
(
t
,
u
,
v
) and G
(
t
,
u
,
v
) be obtained by substituting [
y
(
x
)
]
α
=
[
u
,
v
] (46) (56)
y
_
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
_
n
+
1
x
;
α
=
L
-
1
A
n
,
n
≥
0
.
y
¯
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
¯
n
+
1
x
;
α
=
L
-
1
B
n
,
n
≥
0
.The domain where F and G are defined is therefore (57)
K
=
x
,
u
,
v
∣
0
≤
x
≤
t
,
-
∞
<
u
<
∞
,
-
∞
<
v
<
∞
.Theorem 13 (see [33]).
F
(
t
,
u
,
v
) and G
(
t
,
u
,
v
) belong to the Adomian polynomials A
K, B
K and let the partial derivatives of F, G be bounded over K. Then, for arbitrary fixed α
,
0
≤
α
≤
1, the approximates of (46) converge to the exact solutions Y
1
(
x
;
α
) and Y
2
(
x
;
α
) uniformly in x.Proof.
In order to verify thatA
k, B
K (12) depends only on u
0
,
u
1
,
…
,
u
k, we can express A
k, B
K as a function of the coefficients of the two series that are composed using a classical theorem of power series composition [34]. We can note that the expression obtained is only used to prove this dependence. The practical formula will be exposed in Section 5.1. We have just proved that ∑
A
k, ∑
‍
B
K is a decomposition series. Now if ∑
u
n is a convergent series, then ∑
A
k
(
u
0
⋯
u
k
), ∑
B
k
(
u
0
⋯
u
k
) converges and then its sum is F
∘
u
+
(
1
)
=
F
(
u
)
,
G
∘
u
+
(
1
)
=
G
(
u
); that is to say, that the decomposition series ∑
A
k, ∑
B
K weakly converges and that its sum is F and G. Now, if ∑
u
n and ∑
‍
v
n are two series having the same sum U, and if their Adomian’s polynomials are, respectively, A
k
u, A
k
v and B
k
u, B
k
v then we can write (58)
∑
k
=
0
∞
A
k
u
=
F
∘
u
+
λ
=
1
=
F
U
=
F
∘
v
+
λ
=
1
=
∑
k
=
0
∞
A
k
v
,
∑
k
=
0
∞
B
k
u
=
G
∘
u
+
λ
=
1
=
G
U
=
G
∘
v
+
λ
=
1
=
∑
k
=
0
∞
B
k
v
.So, the sum of the Adomian decomposition series depends only on the sum of the considered series: the convergence is strong.


### 5.2. Numerical Example

Here, we solve the linear delay differential equations with fuzzy initial conditions to find approximate solutions and tabulated with graphical representation, to the analysis.Example 1.
Consider the linear fuzzy delay differential equation(59)
y
′
x
=
1
2
e
x
/
2
y
x
2
+
1
2
y
xsubject to initial conditions y
(
0
)
=
1, then by Definition 3, we have y
(
0
)
=
(
α
;
2
-
α
).
The exact solution of (59) is(60)
y
_
x
;
α
=
α
e
x
,
y
¯
x
;
α
=
2
-
α
e
x
.
To approximate (59) by the Adomian decomposition method, it can be written in an operator form (61)
L
y
_
x
=
1
2
e
x
/
2
y
_
x
2
+
1
2
y
_
x
,
L
y
¯
x
=
1
2
e
x
2
y
¯
x
2
+
1
2
y
¯
x
,with the initial conditions (62)
y
_
0
=
α
,
y
¯
0
=
2
-
α
,where L
=
d
/
d
x is the differential operator. By operating the two sides of above equation with the inverse operator (namely, L
-
1
(
∗
)
=
∫
‍
(
∗
)
d
x) and using the given initial conditions, we have (63)
y
_
x
;
α
=
α
+
∫
1
2
e
x
/
2
y
_
x
2
+
1
2
y
_
x
d
x
,
y
¯
x
;
α
=
2
-
α
+
∫
1
2
e
x
/
2
y
¯
x
2
+
1
2
y
¯
x
d
x
.Then we obtain the recursive relationship (64)
y
_
0
x
;
α
=
α
,
y
_
n
+
1
x
;
α
=
∫
1
2
e
x
/
2
y
_
n
x
2
+
1
2
y
_
n
x
d
x
,
y
¯
0
x
;
α
=
2
-
α
,
y
¯
n
+
1
x
;
α
=
∫
1
2
e
x
2
y
¯
n
x
2
+
1
2
y
¯
n
x
d
x
.Hence we have (65)
y
0
_
=
α
y
1
_
=
1
2
α
-
2
+
2
e
x
/
2
+
x
y
2
_
=
1
24
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
⋮
y
0
¯
=
2
-
α
y
1
¯
=
-
1
2
2
-
α
-
2
+
2
e
x
/
2
+
x
y
2
¯
=
-
1
24
2
-
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
⋮Consequently, the series solution is found as (66)
y
_
x
=
α
+
1
2
α
-
2
+
2
e
x
/
2
+
x
+
1
24
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
+
⋯
,
y
¯
x
=
2
-
α
-
1
2
2
-
α
-
2
+
2
e
x
/
2
+
x
-
1
24
2
-
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
+
⋯
.The exact solution of (59) subject to the initial condition is (60); the comparison of the exact solution Table 1 and the approximate solution Table 2 is given in Table 3 (Error estimation). The approximate solution is calculated at 25 iterations. Figure 2 shows the graphical representation of the approximate solutions which is very quite close to the exact solution.Table 1
Exact solution.
α
y
_
(
x
)
y
¯
(
x
)
0
0
5.43656364
0.2
0.54365637
4.89290729
0.4
1.08731273
4.34925093
0.6
1.63096910
3.80559456
0.8
2.17462546
3.26193819
1.0
2.71828183
2.71828182Table 2
Approximate solution.
α
y
_
(
x
)
y
¯
(
x
)
0
0
5.43656364
0.2
0.54365584
4.89290729
0.4
1.08731168
4.34925093
0.6
1.63096756
3.80559456
0.8
2.17462335
3.26193819
1.0
2.71827919
2.71828182Table 3
Error estimation.
α
y
_
(
x
)
y
¯
(
x
)
0
0
1.69181
×
1
0
-
8
0.2
5.2727810
×
1
0
-
7
1.2263
×
1
0
-
9
0.4
1.0545563
×
1
0
-
6
5.5345
×
1
0
-
9
0.6
1.5818344
×
1
0
-
6
9.8442
×
1
0
-
9
0.8
2.1091126
×
1
0
-
6
4.1509
×
1
0
-
9
1
2.6363907
×
1
0
-
6
8.459
×
1
0
-
9Figure 2
Graph atx
=
1.


## 5.1. Approximate Solutions of Fuzzy Delay Differential Equations by Applying the Adomian Decomposition Method

Consider the DDE [20, 31, 32] (31)
y
x
=
f
x
,
y
x
,
y
x
-
t
,
0
≤
x
≤
1with initial conditions (32)
y
i
0
=
y
_
0
i
;
y
¯
0
i
,
i
=
0,1
,
2
,
…
,
N
-
1
y
x
=
ϕ
x
,
x
≤
0
.Let Y
=
[
Y
1
,
Y
2
] be the exact solution and let y
=
[
y
1
,
y
2
] be the approximate solution of the given equation (33)
Y
x
α
=
Y
1
x
,
x
-
t
;
α
,
Y
2
x
,
x
-
t
;
α
,
y
x
α
=
y
1
x
,
x
-
t
;
α
,
y
2
x
,
x
-
t
;
α
,keeping argument the value of α fixed; then the exact and approximate solution of x
n are represented by (34)
Y
x
α
=
Y
1
x
,
x
-
t
;
α
,
Y
2
x
,
x
-
t
;
α
,
y
x
α
=
y
1
x
,
x
-
t
;
α
,
y
2
x
,
x
-
t
;
α
,
0
≤
n
≤
N
.Now, the approximate solution is solved by the proposed Adomian decomposition method. We arrive at the following equation:(35)
L
y
_
x
;
α
=
f
x
,
y
_
x
,
y
_
x
-
t
;
α
,
0
≤
x
≤
1
,
L
y
¯
x
;
α
=
f
x
,
y
¯
x
,
y
¯
x
-
t
;
α
,
0
≤
x
≤
1
,where L
(
·
)
=
d
N
(
·
)
/
d
x
N is the differential operator. Operating on both sides of the above equation with the inverse operator (namely, L
-
1
(
∗
)
=
∫
‍
∫
‍
⋯
∫
‍
(
∗
)
d
x
d
x
⋯
d
x
) on using the given initial conditions, we have (36)
L
-
1
·
=
∫
x
0
·
N
t
i
m
e
s
d
xtherefore in operating with L
-
1 on (35) and we have(37)
y
_
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
i
+
L
-
1
f
x
,
y
_
x
,
y
_
x
-
t
,
(38)
y
¯
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
i
+
L
-
1
f
x
,
y
¯
x
,
y
¯
x
-
t
, where α
i is constant initial condition. In Adomain decomposition method, it is assumed that the unknown functions y
(
x
) can be expressed by an infinite series of the form (39)
y
_
x
=
∑
n
=
0
∞
y
_
n
x
,
(40)
y
¯
x
=
∑
n
=
0
∞
y
¯
n
x
;by these components, y
_
n
(
x
) and y
¯
n
(
x
) are determined.The nonlinear termsf
(
x
,
y
_
(
x
)
,
y
_
(
x
-
t
)
)
;
f
(
x
,
y
¯
(
x
)
,
y
¯
(
x
-
t
)
) are defined by the Adomian polynomials as (41)
f
x
,
y
_
x
,
y
_
x
-
t
=
∑
n
=
0
∞
A
n
,
(42)
f
x
,
y
¯
x
,
y
¯
x
-
t
=
∑
n
=
0
∞
B
n
,where A
n and B
n are Adomian polynomials that can be generated for all forms of non linearity [
36
] as(43)
A
n
=
1
n
!
d
n
d
μ
n
f
x
,
∑
i
=
0
∞
μ
i
y
i
_
x
,
∑
i
=
0
∞
μ
i
y
i
_
x
-
t
μ
=
0
,
B
n
=
1
n
!
d
n
d
δ
n
f
x
,
∑
i
=
0
∞
δ
i
y
i
¯
x
,
∑
i
=
0
∞
δ
i
y
i
¯
x
-
t
δ
=
0
,on substituting (39) and (41) in (37) and (40) and (42) in (38), we have (44)
∑
n
=
0
∞
y
_
n
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
∑
n
=
0
∞
A
n
;
∑
n
=
0
∞
y
¯
n
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
∑
n
=
0
∞
B
nto determine the components y
_
n
(
x
;
α
)
;
y
¯
n
(
x
;
α
)
,
n
≥
0. We need to find the y
_
0
(
x
;
α
) and y
¯
0
(
x
;
α
) zero component first by all terms that arise from the initial conditions at x
=
0 and from integrating the source term if it exists. Second, the remaining components of y
_
n
(
x
;
α
)
;
y
¯
n
(
x
;
α
) can be determined in a way such that each component is determined by using the preceding components. In other words, the method introduces the recursive relation (45)
y
_
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
_
n
+
1
x
;
α
=
L
-
1
A
n
,
n
≥
0
(46)
y
¯
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
¯
n
+
1
x
;
α
=
L
-
1
B
n
,
n
≥
0
,for the determination of the components y
_
n
(
x
;
α
); y
¯
n
(
x
;
α
)
,
n
≥
0 of y
¯
(
x
;
α
); y
¯
(
x
;
α
), the series solution of y
_
(
x
); y
¯
(
x
;
α
) follows immediately with the constant α
j, j
=
0,1
,
2
,
…
,
N
-
1 are as yet undetermined. The solution of the fuzzy delay differential equation in form (33) can be determined by the series (37) and (38) with the iterations (45) and (46).Define(47)
F
x
,
y
x
,
y
x
-
t
;
α
=
F
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
,
G
x
,
y
x
,
y
x
-
t
;
α
=
G
x
,
y
_
x
;
α
,
y
¯
x
;
α
,
y
_
x
-
t
;
α
,
y
¯
x
-
t
;
α
. The exact and approximate solutions at x
n, 0
≤
n
≤
N are denoted by [
Y
(
x
n
)
]
α
=
[
Y
1
(
(
x
n
)
;
α
)
,
Y
2
(
(
x
n
)
;
α
)
] and [
y
(
x
n
)
]
α
=
[
y
1
(
(
x
n
)
;
α
)
,
y
2
(
(
x
n
)
;
α
)
], respectively. By (33) and (45), (46) we have(48)
Y
1
x
n
+
1
;
α
≈
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
F
∑
n
=
0
∞
A
n
;
Y
2
x
n
+
1
;
α
≈
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
G
∑
n
=
0
∞
B
n
.We define(49)
y
1
x
n
+
1
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
F
∑
n
=
0
∞
A
n
;
y
2
x
n
+
1
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
+
L
-
1
G
∑
n
=
0
∞
B
n
.The following lemmas will be applied to show convergence of these approximates. That is,(50)
lim
n
→
0
⁡
y
1
x
;
α
=
Y
1
x
;
r
,
lim
n
→
0
⁡
y
2
x
;
α
=
Y
2
x
;
r
.Lemma 11 (see [5]).
Let the sequence of numbers{
W
n
}
n
=
0
N satisfy (51)
W
n
+
1
≤
A
W
n
+
B
,
0
≤
n
≤
N
-
1
,for some given positive constants A and B. Then (52)
W
n
≤
A
n
W
0
+
B
A
n
-
1
A
-
1
,
0
≤
n
≤
N
.Lemma 12 (see [5]).
Let the sequence of numbers{
W
n
}
n
=
0
N, {
V
n
}
n
=
0
N satisfy (53)
W
n
+
1
≤
A
W
n
+
A
max
⁡
W
n
,
V
n
+
B
,
V
n
+
1
≤
A
V
n
+
A
max
⁡
W
n
,
V
n
+
B
,for some given positive constants A and B, and denote (54)
U
n
=
W
n
+
V
n
,
0
≤
n
≤
N
.Then (55)
U
n
=
A
¯
n
U
0
+
B
¯
A
¯
n
-
1
A
¯
-
1
,
0
≤
n
≤
N
,where A
¯
=
1
+
2
A and B
¯
=
2
A.Proof.
LetF
(
t
,
u
,
v
) and G
(
t
,
u
,
v
) be obtained by substituting [
y
(
x
)
]
α
=
[
u
,
v
] (46) (56)
y
_
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
_
n
+
1
x
;
α
=
L
-
1
A
n
,
n
≥
0
.
y
¯
0
x
;
α
=
∑
j
=
0
N
-
1
α
j
j
!
x
j
,
y
¯
n
+
1
x
;
α
=
L
-
1
B
n
,
n
≥
0
.The domain where F and G are defined is therefore (57)
K
=
x
,
u
,
v
∣
0
≤
x
≤
t
,
-
∞
<
u
<
∞
,
-
∞
<
v
<
∞
.Theorem 13 (see [33]).
F
(
t
,
u
,
v
) and G
(
t
,
u
,
v
) belong to the Adomian polynomials A
K, B
K and let the partial derivatives of F, G be bounded over K. Then, for arbitrary fixed α
,
0
≤
α
≤
1, the approximates of (46) converge to the exact solutions Y
1
(
x
;
α
) and Y
2
(
x
;
α
) uniformly in x.Proof.
In order to verify thatA
k, B
K (12) depends only on u
0
,
u
1
,
…
,
u
k, we can express A
k, B
K as a function of the coefficients of the two series that are composed using a classical theorem of power series composition [34]. We can note that the expression obtained is only used to prove this dependence. The practical formula will be exposed in Section 5.1. We have just proved that ∑
A
k, ∑
‍
B
K is a decomposition series. Now if ∑
u
n is a convergent series, then ∑
A
k
(
u
0
⋯
u
k
), ∑
B
k
(
u
0
⋯
u
k
) converges and then its sum is F
∘
u
+
(
1
)
=
F
(
u
)
,
G
∘
u
+
(
1
)
=
G
(
u
); that is to say, that the decomposition series ∑
A
k, ∑
B
K weakly converges and that its sum is F and G. Now, if ∑
u
n and ∑
‍
v
n are two series having the same sum U, and if their Adomian’s polynomials are, respectively, A
k
u, A
k
v and B
k
u, B
k
v then we can write (58)
∑
k
=
0
∞
A
k
u
=
F
∘
u
+
λ
=
1
=
F
U
=
F
∘
v
+
λ
=
1
=
∑
k
=
0
∞
A
k
v
,
∑
k
=
0
∞
B
k
u
=
G
∘
u
+
λ
=
1
=
G
U
=
G
∘
v
+
λ
=
1
=
∑
k
=
0
∞
B
k
v
.So, the sum of the Adomian decomposition series depends only on the sum of the considered series: the convergence is strong.


## 5.2. Numerical Example

Here, we solve the linear delay differential equations with fuzzy initial conditions to find approximate solutions and tabulated with graphical representation, to the analysis.Example 1.
Consider the linear fuzzy delay differential equation(59)
y
′
x
=
1
2
e
x
/
2
y
x
2
+
1
2
y
xsubject to initial conditions y
(
0
)
=
1, then by Definition 3, we have y
(
0
)
=
(
α
;
2
-
α
).
The exact solution of (59) is(60)
y
_
x
;
α
=
α
e
x
,
y
¯
x
;
α
=
2
-
α
e
x
.
To approximate (59) by the Adomian decomposition method, it can be written in an operator form (61)
L
y
_
x
=
1
2
e
x
/
2
y
_
x
2
+
1
2
y
_
x
,
L
y
¯
x
=
1
2
e
x
2
y
¯
x
2
+
1
2
y
¯
x
,with the initial conditions (62)
y
_
0
=
α
,
y
¯
0
=
2
-
α
,where L
=
d
/
d
x is the differential operator. By operating the two sides of above equation with the inverse operator (namely, L
-
1
(
∗
)
=
∫
‍
(
∗
)
d
x) and using the given initial conditions, we have (63)
y
_
x
;
α
=
α
+
∫
1
2
e
x
/
2
y
_
x
2
+
1
2
y
_
x
d
x
,
y
¯
x
;
α
=
2
-
α
+
∫
1
2
e
x
/
2
y
¯
x
2
+
1
2
y
¯
x
d
x
.Then we obtain the recursive relationship (64)
y
_
0
x
;
α
=
α
,
y
_
n
+
1
x
;
α
=
∫
1
2
e
x
/
2
y
_
n
x
2
+
1
2
y
_
n
x
d
x
,
y
¯
0
x
;
α
=
2
-
α
,
y
¯
n
+
1
x
;
α
=
∫
1
2
e
x
2
y
¯
n
x
2
+
1
2
y
¯
n
x
d
x
.Hence we have (65)
y
0
_
=
α
y
1
_
=
1
2
α
-
2
+
2
e
x
/
2
+
x
y
2
_
=
1
24
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
⋮
y
0
¯
=
2
-
α
y
1
¯
=
-
1
2
2
-
α
-
2
+
2
e
x
/
2
+
x
y
2
¯
=
-
1
24
2
-
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
⋮Consequently, the series solution is found as (66)
y
_
x
=
α
+
1
2
α
-
2
+
2
e
x
/
2
+
x
+
1
24
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
+
⋯
,
y
¯
x
=
2
-
α
-
1
2
2
-
α
-
2
+
2
e
x
/
2
+
x
-
1
24
2
-
α
-
4
+
16
e
3
x
/
4
-
2
+
x
-
12
x
+
3
x
2
+
⋯
.The exact solution of (59) subject to the initial condition is (60); the comparison of the exact solution Table 1 and the approximate solution Table 2 is given in Table 3 (Error estimation). The approximate solution is calculated at 25 iterations. Figure 2 shows the graphical representation of the approximate solutions which is very quite close to the exact solution.Table 1
Exact solution.
α
y
_
(
x
)
y
¯
(
x
)
0
0
5.43656364
0.2
0.54365637
4.89290729
0.4
1.08731273
4.34925093
0.6
1.63096910
3.80559456
0.8
2.17462546
3.26193819
1.0
2.71828183
2.71828182Table 2
Approximate solution.
α
y
_
(
x
)
y
¯
(
x
)
0
0
5.43656364
0.2
0.54365584
4.89290729
0.4
1.08731168
4.34925093
0.6
1.63096756
3.80559456
0.8
2.17462335
3.26193819
1.0
2.71827919
2.71828182Table 3
Error estimation.
α
y
_
(
x
)
y
¯
(
x
)
0
0
1.69181
×
1
0
-
8
0.2
5.2727810
×
1
0
-
7
1.2263
×
1
0
-
9
0.4
1.0545563
×
1
0
-
6
5.5345
×
1
0
-
9
0.6
1.5818344
×
1
0
-
6
9.8442
×
1
0
-
9
0.8
2.1091126
×
1
0
-
6
4.1509
×
1
0
-
9
1
2.6363907
×
1
0
-
6
8.459
×
1
0
-
9Figure 2
Graph atx
=
1.


## 6. Conclusion

In this paper, we have introduced an algorithm for finding approximate solutions of delay differential equations with Adomian decomposition method. For illustration purposes, an example is selected to show the computational accuracy. It may be concluded that the Adomian decomposition method is very powerful and efficient in finding approximate solutions for wide classes of problems. The solutions obtained by the present method are uniformly convergent. As shown in Tables1–3, results of numerical example show that the present method is an accurate and reliable analytical method for these problems. The present study has confirmed that the Adomian decomposition method offers significant advantages in terms of its straightforward applicability, its computational effectiveness, and its accuracy to solve the strongly linear equations. The Mathematica package 5.2 is used to solve the fuzzy delay differential equations.



---

*Source: 273830-2015-10-29.xml*