# Applied Mathematical Sciences, Vol. 6, 2012, no.

59, 2935 - 2944

Solving Fuzzy Duffing’s Equation by the Laplace Transform Decomposition
‫܌܉ܕܐۯ ܑܖ܉’ܚܗܗۼ‬૚ , Mustafa ‫ ܜ܉ܕ܉ۻ‬૛ , J. ۹‫ ܚ܉ܕܝܓܑܞ܉‬૜ and Nor ‫ ܚܑܕۯ ܐ܉܌ܑܛܕ܉ܐ܁‬۶‫ܐ܉ܢܕ܉‬૝

1,3,4

Department of Science and Mathematics, Faculty of Science Arts and Heritage, Universiti Tun Hussein Onn Malaysia 86400 Parit Raja, Johor, Malaysia.

Department of Mathematics, Faculty of Science and Technology Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Malaysia mus@umt.edu.my Abstract The Laplace transform decomposition algorithm (LTDA) is a numerical algorithm which can be adapted to solve the Fuzzy Duffing equations (FDE). This paper will describe the principle of LTDA and discusses its advantages. Concrete examples are also studied to show the numerical results on how LTDA efficiently work to solve the Duffing equations in the fuzzy setting. Keywords: Laplace transform decomposition algorithm, differential equations, Fuzzy Duffing equations, numerical algorithm, Maple.

2

1 Introduction
Various problems involving nonlinear control systems in physics, engineering and communication theory, makes increasing interest to study the periodically forced Duffing's equation [6, 10-12]. In many cases, the Duffing’s equations have their uncertainty known as fuzzy Duffing’s equation (FDE). The Adomian decomposition method (ADM) can be used to find the solutions of a large class of nonlinear problems [1, 5, 7, 8, 13, 14]. However, the implementation of the ADM mainly depends upon the calculation of Adomian polynomials for the nonlinear operators and their numerical solutions were obtained in the form of finite series.

The Adomian decomposition method has been proved to be reliable. we discuss the conclusion and future research. 7]. The decomposition method has been introduced by Adomian [9] to solve linear and nonlinear functional equations such as in algebraic. … . The decomposition method consists of splitting the given equation into linear and nonlinear terms. In this study. The linear term y(x) represents an infinite sum of components ‫ݕ‬௡ ሺ‫ݔ‬ሻ. An iterative algorithm is achieved for the determination of ‫ݕ‬௡ ‫ ݏ‬in recursive manner. integral. etc. In section 2. ‫ݕ‬ଵ . differential. partial differential. number in [0. in order to solve the FDE. An α-cut of ‫ܣ‬ . ݊ ൌ 0. By using the Maple software. 4]. the algorithm is practically applied in relation to the numerical examples. 1] for the membership function of ‫ ܣ‬evaluates at x.1. We place a ~ ሚ ሺ‫ݔ‬ሻ. ‫ݕ‬ଶ . the initial values in the form of fuzzy numbers will be transformed in the parametric forms. 2 Preliminaries This section will begin with defining the notation used in this paper. a sign over a letter to denote a fuzzy subset of the real numbers. and the numerical results show that the LTDA approximates the exact solution with a high degree of accuracy using only few terms of the iterative scheme. with fuzzy initial value problems. ‫ݕ‬௡ . we have applied the Laplace. In section 4. In this case. In section 3. the truncated sum is calculated. We write ‫ܣ‬ ሚ ሚ. … defined by ‫ݕ‬ሺ‫ ݔ‬ሻ ൌ ෍ ‫ݕ‬௡ ሺ‫ݔ‬ሻ ௡ୀ଴ ∞ The decomposition method identifies the nonlinear term ‫ܨ‬ሺ‫ݕ‬ሺ‫ ݔ‬ሻሻ by the decomposition series ‫ܨ‬ሺ‫ݕ‬ሺ‫ ݔ‬ሻሻ ൌ ෍ ‫ܣ‬௡ ௡ୀ଴ ∞ where ‫ܣ‬௡ s are Adomian’s polynomial of ‫ݕ‬଴ .2936 Noor'ani Ahmad et al The present paper aims at offering an alternative method to get solution of the FDE by using the Laplace transform numerical scheme on the basis of the decomposition method [12] named Laplace transform decomposition method (LTDM).2. we bring some basic definitions of fuzzy numbers and how the LTDA is applied in solving FDE. Fuzzy numbers are considered because many situations in real-world are facing uncertainty and vagueness [3. ‫ݕ‬ሺ‫ ݔ‬ሻ ൌ ෍ ‫ݕ‬௡ ௡ୀ଴ ௄ This paper is organized as follows. accurate and effective in both the analytic and the numerical purposes [2.

2.4) 3. 1. ܾଷ ൅ ሺܾଶ െ ܾଷ ሻ‫ݎ‬ሻ respectively. ∝ ൯ and ‫ ݕ‬′ ሺ0ሻ ൌ ቀߚ . (2. ܾଷ ሻ. and ‫݌‬ଶ are real constants and ∝ and ߚ in parametric forms. ‫݌‬ଵ . x = y if and only if ‫( ݔ‬α )= ‫( ݕ‬α ) and ‫( ݔ‬α ) = ‫( ݕ‬α ). ߚ ቁ ൌ ሺܾଵ ൅ ሺܾଶ െ ܾଵ ሻ‫ ݎ‬. which satisfies the following requirements: 1. ݇ ൒ 0. then the parametric forms for and ߚ are ൫∝ . ∝൯‫ ݏ‬൅ ቀߚ. ݇‫ ݔ‬൯.1].3) By using linearity of Laplace transform. ܽଷ ሻ and ߚ ൌ ሺܾଵ . The Laplace transform Decomposition Method is applied to find the solution to the following nonlinear fuzzy initial value problems: ‫ ݕ‬′′ ൅ ‫ ݕ݌‬′ ൅ ‫݌‬ଵ ‫ ݕ‬൅ ‫݌‬ଶ ‫ ݕ‬ଷ ൌ ݂ሺ‫ݔ‬ሻ. ‫( ݑ‬α ) is a bounded left continuous non decreasing function over [0. for 0 ൏ ߙ ൑ 1 and α–cuts of fuzzy written by ‫ܣ‬ numbers are always closed and bounded. ሚ ሺߙሻ. ‫( ̅ݔ‬α ) + ‫ ݕ‬ ഥ (α )). ܽଷ ൅ ሺܽଶ െ ܽଷ ሻ‫ݎ‬ሻ and ቀߚ . ߚቁ ൅ ൫∝. ‫( ݔ‬α) ) . If ∝ൌ ሺܽଵ . (2. (2. 2. y = ( ‫( ݕ‬α ). we obtain ‫ ݏ‬ଶ ࣦሾ‫ݕ‬ሿ െ ‫ݕ‬ሺ0ሻ‫ ݏ‬െ ‫ ݕ‬′ ሺ0ሻ ൅ ‫݌‬ሼ‫ࣦݏ‬ሾ‫ݕ‬ሿ െ ‫ݕ‬ሺ0ሻሽ ൅ ‫݌‬ଵ ࣦሾ‫ݕ‬ሿ ൅ ‫݌‬ଶ ࣦሾ‫ ݕ‬ଷ ሿ ൌ ࣦሾ݂ሺ‫ݔ‬ሻሿ. ∝൯‫ ݌‬െ ‫݌‬ଵ ࣦሾ‫ݕ‬ሿ െ ‫݌‬ଶ ࣦሾ‫ ݕ‬ଷ ሿ ൅ ሺࣦሾ݂ሺ‫ݔ‬ሻሿ ሺ2. A crisp number α is simply represented by ‫( ݑ‬α ) = ‫( (ݑ‬α ) = α .1) ‫ݕ‬ሺ0ሻ ൌ ൫∝ .2) where ‫݌‬. ∝ ൯ ൌ ሺܽଵ ൅ ሺܽଶ െ ܽଵ ሻ‫ ݎ‬. ߚ ቁ. 0 ≤ α ≤ 1. 0 ≤ α ≤ 1. ݇ ൏ 0. x + y = ( ‫( ݔ‬α ) + ‫( ݕ‬α ). (2. For arbitrary fuzzy numbers x =(‫( ݔ‬α).6ሻ or . ‫( ݑ‬α ) ≤ ‫( ݑ‬α ). we have ሺ‫ ݏ‬ଶ ൅ ‫ݏ݌‬ሻࣦሾ‫ݕ‬ሿ ൌ ൫∝. we obtain ࣦሾ‫ ݕ‬′′ ሿ ൅ ‫ࣦ݌‬ሾ‫ ݕ‬′ ሿ ൅ ‫݌‬ଵ ࣦሾ‫ݕ‬ሿ ൅ ‫݌‬ଶ ࣦሾ‫ ݕ‬ଷ ሿ ൌ ࣦሾ݂ ሺ‫ ݔ‬ሻሿ (2. The method consists of applying Laplace transformation (denoted throughout this paper by ࣦሾ‫ ݕ‬′′ ሿ ൅ ࣦሾ‫ ݕ݌‬′ ሿ ൅ ࣦሾ‫݌‬ଵ ‫ݕ‬ሿ ൅ ࣦሾ‫݌‬ଶ ‫ ݕ‬ଷ ሿ ൌ ࣦሾ݂ሺ‫ݔ‬ሻሿ. ൫݇‫ ݔ‬. ݇‫ ݔ‬ൌ ቊ ൫݇‫ݔ‬. ‫ݑ‬ሺߙሻቁ. ܾଶ . ‫( ݕ‬α )) and real number k. 3. ݇‫ ݔ‬൯. ܽଶ .2). We represent an arbitrary fuzzy number Applying the formulas on Laplace transform. Let F be the set of all upper semi-continuous normal convex fuzzy numbers with bounded α-level sets.is defined as ൛‫ݔ‬ห‫ܣ‬ ሚ ൒ ߙൟ. ‫( ݑ‬α ) is a bounded left continuous non increasing function over [0.Solving fuzzy Duffing’s equation 2937 by an ordered pair of functions ቀ‫ݑ‬ሺߙሻ.5) using the initial condition (2.1].

ଶ ଺ and for ݄ሺ‫ݕ‬ሻ ൌ ‫ ݕ‬ଷ they are given by ‫ܣ‬଴ ൌ ‫ݕ‬଴ ଷ .12ሻ The first few polynomials are given by ‫ܣ‬଴ ൌ ݄ሺ‫ݕ‬଴ ሻ. in particular ‫ ݕ‬ൌ ෍ ‫ݕ‬௡ . 1. ݊ ൌ 0. … . … ሺ2.11ሻ ఒୀ଴ . ∝ሻ‫݌‬ ‫ݏ‬ଶ ൅ ‫ݏ݌‬ 1 ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ. (2. ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦ ቂ‫ݕ‬ቃ ൌ െ ଶ ࣦሾ‫ݕ‬ሿ െ ଶ ࣦሾ‫ ݕ‬ଷ ሿ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ 1 ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ. 1 ‫ܣ‬ଶ ൌ ‫ݕ‬ଶ ݄ଵ ሺ‫ݕ‬଴ ሻ ൅ ‫ݕ‬ଵ ଶ ݄ଶ ሺ‫ݕ‬଴ ሻ.7) are in the fuzzy forms written as lower and upper cases. ߚቁ ൅ ሺ∝.8ሻ ‫ ݏ‬൅ ‫ݏ݌‬ ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦሾ‫ݕ‬ሿ ൌ െ ଶ ࣦሾ‫ݕ‬ሿ െ ଶ ࣦሾ‫ ݕ‬ଷ ሿ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ 1 ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ. ‫ݕ‬௡ and are calculated by the formula 1 ݀௡ ‫ܣ‬௡ ൌ ሾ ௡ ሾ݄ ෍ ߣ௜ ‫ݕ‬௜ ሿሿ ݊! ݀ߣ ∞ ௜ୀ଴ ݄ሺ‫ݕ‬ሻ ൌ ‫ ݕ‬ൌ ෍ ‫ܣ‬௡ .2938 Noor'ani Ahmad et al ࣦሾ‫ݕ‬ሿ ൌ ൫∝.13) . (2.10ሻ where the term ‫ݕ‬௡ are to recursively calculated.7ሻ ‫ ݏ‬൅ ‫ݏ݌‬ െ ‫ݏ‬ଶ ‫݌‬ଵ ‫݌‬ଶ ࣦሾ‫ݕ‬ሿ െ ଶ ࣦሾ‫ ݕ‬ଷ ሿ ൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ In other words Eq. ‫ܣ‬ଵ ൌ 3‫ݕ‬଴ ‫ݕ‬ଵ .9ሻ ‫ ݏ‬൅ ‫ݏ݌‬ The Laplace transform decomposition technique consists next of representing the solution as an infinite series. ሺ2. Also the nonlinear operator ݄ሺ‫ݕ‬ሻ ൌ ‫ ݕ‬ଷ is decomposed as ଷ ∞ ௡ୀ଴ ௡ୀ଴ ∞ where the ‫ܣ‬௡ s are Adomian polynomials of ‫ݕ‬଴ . ሺ2. ‫ܣ‬ଵ ൌ ‫ݕ‬ଵ ݄ଵ ሺ‫ݕ‬଴ ሻ. 2. ∝ ൯‫ ݏ‬൅ ቀߚ. ሺ2. ‫ݕ‬ଵ . 2 ଵ ଵ ‫ܣ‬ଷ ൌ ‫ݕ‬ଷ ݄ଵ ሺ‫ݕ‬଴ ሻ ൅ ‫ݕ‬ଵ ‫ݕ‬ଶ ݄ଶ ሺ‫ݕ‬଴ ሻ ൅ ‫ݕ‬ଵ ଷ ݄ଷ ሺ‫ݕ‬଴ ሻ. ሺ2. ሺ2.

ࣦൣ‫ݕ‬ଵ ൧ ൌ െ . For lower case: ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ 1 ࣦ ቂ‫ݕ‬଴ ቃ ൌ ൅ ଶ ࣦሾ݂ሺ‫ ݔ‬ሻሿ ሺ2. ሺ2.18ሻ ࣦ ቂ‫ݕ‬ଵ ቃ ൌ െ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦ ቂ‫ݕ‬ଶ ቃ ൌ െ ଶ ࣦ ቂ‫ݕ‬ଵ ቃ െ ଶ ࣦൣ‫ܣ‬ଵ ൧.20ሻ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦൣ‫ݕ‬଴ ൧ െ ଶ ࣦൣ‫ܣ‬଴ ൧. ሺ2.14) Substituting (2.22ሻ ൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦൣ‫ݕ‬ଶ ൧ ൌ െ ଶ ࣦൣ‫ݕ‬ଵ ൧ െ ଶ ࣦൣ‫ܣ‬ଵ ൧.16). ‫ݏ‬ଶ For upper case: ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ 1 ࣦൣ‫ݕ‬଴ ൧ ൌ ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ ሺ2. and (2. .11) to (2.10). ‫ܣ‬ଷ ൌ 3‫ݕ‬଴ ‫ݕ‬ଷ ൅ 6‫ݕ‬଴ ‫ݕ‬ଵ ‫ݕ‬ଶ ൅ ‫ݕ‬ଵ ଷ .16ሻ ‫ ݏ‬൅ ‫ݏ݌‬ Matching both sides of (2. ‫݌‬ଵ ‫݌‬ଶ ࣦ ቂ‫ݕ‬௡ାଵ ቃ ൌ െ ଶ ࣦ ቂ‫ݕ‬௡ ቃ െ ଶ ࣦൣ‫ܣ‬௡ ൧.23ሻ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ . .17ሻ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦ ቂ‫ݕ‬଴ ቃ – ଶ ࣦൣ‫ܣ‬଴ ൧.19ሻ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ .21ሻ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ .Solving fuzzy Duffing’s equation ‫ܣ‬ଶ ൌ 3‫ݕ‬଴ ଶ ‫ݕ‬ଶ ൅ 3‫ݕ‬଴ ‫ݕ‬ଵ ଶ . the results are: ∞ ∞ ∞ ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦ ൥෍ ‫ݕ‬൩ ൌ െ ଶ ࣦ ൥෍ ‫ݕ‬൩ െ ଶ ࣦ ൥෍ ‫ܣ‬௡ ൩ ‫ ݏ‬ଶ ൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ௡ୀ଴ ௡ୀ଴ ௡ୀ଴ 1 ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ ሺ2.15) and (2. 2939 (2.8) and (2.15ሻ ‫ ݏ‬൅ ‫ݏ݌‬ ∞ ∞ ∞ ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ ‫݌‬ଵ ‫݌‬ଶ ࣦ ൥෍ ‫ݕ‬൩ ൌ െ ଶ ࣦ ൥෍ ‫ݕ‬൩ െ ଶ ࣦ ൥෍ ‫ܣ‬௡ ൩ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ௡ୀ଴ ௡ୀ଴ ௡ୀ଴ 1 ൅ ଶ ࣦሾ݂ሺ‫ݔ‬ሻሿ. ሺ2. ሺ2.9) respectively. . ሺ2. the following iterative algorithms are obtained. ሺ2.

0. we obtain the values of (‫ݕ‬ଵ . we evaluating the Laplace transform of the quantities on the right side of ࣦሾ‫ݕ‬ଵ . we obtain values ‫ݕ‬ ෤଴. ‫ݕ‬ଶ ሿ.17) and (2.2. If we replace ݂ሺ‫ݔ‬ሻ by ሚሺ‫ݔ‬ሻ ൌ ෍ ܽ௜ ‫ ݔ‬௜ . ‫ݕ‬଴ ሻ. ሺ2.21) become ௞ ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ 1 ܽ௜ ݅! ࣦ ቂ‫ݕ‬଴ ቃ ൌ ൅ ଶ ෍ ௜ାଵ ሺ2. ‫ݕ‬ଷ . and then applying the inverse Laplace transform.2940 ࣦൣ‫ݕ‬௡ାଵ ൧ ൌ െ Noor'ani Ahmad et al ‫݌‬ଵ ‫݌‬ଶ ࣦൣ‫ݕ‬௡ ൧ െ ଶ ࣦൣ‫ܣ‬௡ ൧.21) we obtain the value of ሺ‫ݕ‬଴ .1.3ሻ By using ADM.24) respectively. ሺ2.1ሻ ‫ݕ‬ ෤ ′ ሺ0ሻ ൌ ሺ0. The other terms ‫ݕ‬ଶ .1ሻ with initial conditions ‫ݕ‬ ෤ሺ0ሻ ൌ ሺെ1. … . in this study our initial value problem will be written in the parametric forms of the fuzzy setting and the equation is then solved by LTDM. we can express ݂ሺ‫ݔ‬ሻ in Taylor series at ‫ݔ‬଴ ൌ 0. ݅ ൌ 0. this example was considered in [11] and its solution (3. Consider the Duffing’s equation in the following type: ‫ ݕ‬′′ ൅ 3‫ ݕ‬െ 2‫ ݕ‬ଷ ൌ cos ‫ ݔ‬sin 2‫ ݔ‬ሺ3. Substituting these values of ‫ݕ‬଴ to (2. ‫ݕ‬ ෤ଶ .3) was found. ݇.25ሻ ݅! Eq.20) and (2. ܽ௜ ൌ ݂ ௜ୀ଴ ௞ ݂ ሺ௜ሻ ሺ0ሻ . ‫ݕ‬ଶ ሻ.1. (2. which is truncated for simplification. Since the complicated excitation term ݂ሺ‫ݔ‬ሻ can cause difficult integrations and proliferation of terms.22) respectively.27ሻ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ݏ‬ ‫ ݏ‬൅ ‫ݏ݌‬ By using LTDA which is described above. … ௜ୀ଴ ௜ୀ଴ ௞ 3 Numerical example The Laplace transform decomposition algorithm is illustrated by the following example [8]. .18) and (2.24ሻ ൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ݏ‬ଶ Applying the inverse Laplace transform to (2. ‫ݕ‬ ෤ଵ . Example. However.17) and (2.2ሻ The analytic solution of this equation is ‫ݕ‬ሺ‫ݔ‬ሻ ൌ sinሺ‫ݔ‬ሻ ሺ3. … in lower and upper cases can be obtained recursively in a similar way by using (2.2ሻ ሺ3.26ሻ ଶ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ ݏ‬൅ ‫ݏ݌‬ ‫ݏ‬ ∝ ‫ ݏ‬൅ ߚ ൅∝ ‫݌‬ 1 ܽ௜ ݅! ࣦൣ‫ݕ‬଴ ൧ ൌ ൅ ଶ ෍ ௜ାଵ ሺ2.

6) for the r =0.8) and using ‫ܣ‬ଵ given in (2.13ሻ ‫ݏ‬ ‫ݏ‬ ‫଻ݏ‬ ‫଼ݏ‬ ‫ݏ‬ଽ The inverse Laplace transform applied to (3.5). ሺ3. ሺ3.064‫ ݔ‬ସ ൅ 0.368‫ ݔ‬ଷ െ 0. ሺ3. ‫݌‬ଵ ൌ 3.0058‫ ݔ‬ଵ଴ ൅ 0. (3. If we reapply the given above algorithm.0016‫ ଼ ݔ‬െ 0.0184‫ ଼ ݔ‬൅ ⋯ ሺ3. we obtain 1.2ሻ to Eq.0070‫ ݔ‬ଽ ൅ 0.7ሻ ࣦሾ‫ݕ‬ ෤ଵ ሿ ൌ െ ଶ ࣦሾ‫ݕ‬ ෤଴ ሿ ൅ ଶ ࣦൣ‫ܣ‬ ‫ݏ‬ ‫ݏ‬ 3 2 ሚଵ ൧.9ሻ ࣦሾ‫ݕ‬ ෤௡ାଵ ሿ ൌ െ ଶ ࣦሾ‫ݕ‬ ෤௡ ሿ ൅ ଶ ࣦൣ‫ܣ‬ ‫ݏ‬ ‫ݏ‬ Substituting the inverse Laplace transform to (3.2).0.0028‫ ଺ ݔ‬൅ 0. we obtain 1 7 61 ଻ 547 ‫ݕ‬଴ ൌ െ0.7) we get ‫ݕ‬ଵ ൌ 0. considering ‫ ݌‬ൌ 0.292‫ ݔ‬ଶ െ 0.536 0.13) yields ‫ݕ‬ଶ ൌ 0.0097‫ ݔ‬ଽ ൅ ⋯ ሺ3.624 15.12) to (3.730 48. ∝ൌ ሺെ1. ߚ ൌ ሺ0.5ሻ ‫ ݕ‬′′ ൅ 3‫ ݕ‬െ 2‫ ݕ‬ଷ ൌ ݂ with fuzzy initial condition (3. ‫݌‬ଶ ൌ െ2.16ሻ .11ሻ ‫ݏ‬ଷ ‫ݏ‬ ‫ݏ‬ ‫ݏ‬ ‫ݏ‬ Substituting (3. For example ‫ݕ‬ଷ ൌ 0.14ሻ Operating with Laplace inverse on both sides of (3.12ሻ Higher iterations can be easily obtained by using the Maple software.8‫ ݔ‬൅ ‫ ݔ‬ଷ െ ‫ ݔ‬ହ ൅ ‫ ݔ‬െ ‫ ݔ‬ଽ ሺ3.4ሻ 3 60 2520 Eq.10ሻ 3 60 2520 181440 ଷ Substituting this value of ‫ݕ‬଴ and ‫ܣ‬଴ ൌ ‫ݕ‬଴ given in (2.2 ൅ 0. ሺ3.0228‫ ݔ‬ହ ൅ 0.0022‫ ݔ‬ଵଵ ൅ ⋯ ሺ3.1) becomes ሚሺ‫ ݔ‬ሻ ሺ3.0052‫ ݔ‬ହ ൅ ⋯ ሺ3. we obtain following iterative algorithm: 1 1 ሚ൧.7). then the result is 0. (3.583 742.14) to (3.Solving fuzzy Duffing’s equation 2941 If we replace 7 61 ହ 547 ଻ ሚሺ‫ ݔ‬ሻ ൌ 2‫ ݔ‬െ ‫ ݔ‬ଷ ൅ ݂ ‫ ݔ‬െ ‫ ݔ‬. 3 2 ሚ ௡ ൧.14).994 ࣦሾ‫ݕ‬ଶ ሿ ൌ െ ହ ൅ ଺ ൅ െ ൅ ൅ ⋯ ሺ3.108 184.15ሻ ‫ݕ‬ସ ൌ 0.8 for the lower case.36 ࣦ ቂ‫ݕ‬ଵ ቃ ൌ െ ସ െ ହ ൅ ଺ െ ଻ ൅ ⋯ ሺ3.584 2. ሺ3.0668‫ ଺ ݔ‬െ 0.208 1.03662‫ ଻ ݔ‬൅ 0.6ሻ ࣦሾ‫ݕ‬ ෤଴ ሿ ൌ ଶ ൅ ଶ ࣦൣ݂ ‫ݏ‬ ‫ݏ‬ 3 2 ሚ ଴ ൧.1.0292‫ ଼ ݔ‬൅ 0.612 2.0175‫ ଻ ݔ‬െ 0.8ሻ ࣦሾ‫ݕ‬ ෤ଶ ሿ ൌ െ ଶ ࣦሾ‫ݕ‬ ෤ଵ ሿ ൅ ଶ ࣦൣ‫ܣ‬ ‫ݏ‬ ‫ݏ‬ in general. 1ሻ.

it is easier to get the determinate partial sum ߶௡ ሺ‫ ݔ‬ሻ ൌ ∑௡ ௠ୀ଴ ‫ݕ‬௠ .26ሻ ‫ݕ‬ ෤ଷ ൌ െ 560 960 739200 12812800 1 1843 ଵଵ 20287 ଵଷ 23386949 ଵହ ‫ݕ‬ ෤ସ ൌ ‫ݔ‬ଽ െ ‫ ݔ‬൅ ‫ ݔ‬൅ ‫ ݔ‬൅ ⋯ ሺ3.18ሻ 3 60 2520 181440 ‫ݕ‬ଵ ൌ െ0.8ሻ ൌ 0.2‫ ݔ‬൅ ‫ ݔ‬ଷ െ ‫ ݔ‬൅ ‫ ݔ‬െ ‫ ݔ‬ଽ ሺ3.21ሻ Also calculated the sum of five terms: ߶ହ ሺ‫ ݎ‬ൌ 0.2 ൅ 0.0038‫ݔ‬ଵଵ ൅ ⋯ ሺ3.0239‫ ݔ‬ଽ ൅ ⋯ ሺ3.127‫ ݔ‬ହ ൅ ⋯ ሺ3.2942 Noor'ani Ahmad et al Substituting ‫ ݔ‬ൌ ൌ 1. By using the same method in iterations for the upper case. the results obtained are as below: 1 7 61 ଻ 547 ‫ݕ‬ ෤଴ ൌ ‫ ݔ‬൅ ‫ ݔ‬ଷ െ ‫ ݔ‬ହ ൅ ‫ ݔ‬െ ‫ ݔ‬ଽ ሺ3. we have the sum of five terms ଶ for r = 0.1312‫ ݔ‬ସ ൅ ⋯ ሺ3. ‫ݕ‬ଵ .80253.17ሻ గ Substituting ‫ ݔ‬ൌ ൌ 1.570796327 in Eq.067‫ ݔ‬ସ ൅ 0.0657‫ ଼ ݔ‬൅ 0.570796327 in Eq.24ሻ 2 20 840 60480 3 ହ 3 523 ଽ 18281 ଵଵ ‫ݕ‬ ෤ଶ ൌ ‫ ݔ‬െ ‫ ଻ݔ‬െ ‫ ݔ‬൅ ‫ ݔ‬െ ⋯ ሺ3.17).0000. we have the sum of five terms ଶ for r = 0.19ሻ ‫ݕ‬ଶ ൌ 0.22).0013‫ ݔ‬ଵ଴ ൅ 0. … as below: 1 7 ହ 61 ଻ 547 ‫ݕ‬଴ ൌ 0.2920‫ ݔ‬ଶ െ 0.0001‫ ଼ ݔ‬െ 0.0011‫ ݔ‬ଽ െ 0. we always deal with ambiguities condition for example . 4 Conclusion In this paper.25ሻ 40 40 20160 2217600 3 ଻ 29 ଽ 859 92901 ‫ ݔ‬൅ ‫ ݔ‬൅ ‫ݔ‬ଵଵ െ ‫ ݔ‬ଵଷ ൅ ⋯ ሺ3.22ሻ గ By using Maple. particularly the sum of five terms is calculated as below: ߶ହ ሺ‫ ݎ‬ൌ 0.0262‫ ଻ ݔ‬൅ 0.8 is 1.23ሻ 3 60 2520 181440 1 1 47 ଻ 89 ‫ݕ‬ ෤ଵ ൌ െ ‫ ݔ‬ଷ ൅ ‫ ݔ‬ହ ൅ ‫ ݔ‬െ ‫ ݔ‬ଽ െ ⋯ ሺ3.0347‫ ݔ‬ଷ െ 0. (3. ‫ݕ‬ଶ .034‫ ݔ‬ହ െ 0. investigation on solving FDE by LTDM has been done and exists. we have series of ‫ݕ‬଴ .2 ൅ 1.0 is 1.2 ൅ 1.0ሻ ൌ െ ‫ ݔ‬ଷ ൅ ‫ ݔ‬െ ‫ ଻ݔ‬൅ ‫ ݔ‬ଽ ൅ ⋯ ሺ3. (3.0028‫ ଺ ݔ‬൅ 0.144‫ ݔ‬ସ ൅ 0.8ሻ ൌ െ0. Meanwhile for r = 1.8‫ ݔ‬൅ 0. In the real-world problems.292‫ ݔ‬ଶ െ 0. (3.2187‫ ݔ‬ଷ ൅ 0.118‫ ଻ ݔ‬൅ ⋯ ሺ3.84425.150‫ ଺ ݔ‬െ 0.2‫ ݔ‬െ 0.8 is 0.27ሻ 4480 246400 5491200 8072064000 Also calculated the sum of five terms for 1 1 ହ 1 1 ߶ହ ሺ‫ ݎ‬ൌ 1. we have the sum of five terms ଶ for r = 1.20ሻ ‫ݕ‬ଷ ൌ െ0.570796327 in Eq.2112‫ ݔ‬ସ ൅ ⋯ ሺ3. In this case.28).28ሻ 6 120 5040 362880 గ Substituting ‫ ݔ‬ൌ ൌ 1.20ሻ ‫ݕ‬ସ ൌ 0.552‫ ݔ‬ଷ ൅ 0.2920‫ ݔ‬ଶ െ 0.

141-155. 665-669. 651-657.C. Partial differential Equations: Methods and Applications.K. IEEE Trans Circuits Syst. Balkema Publishers/ Lisse/ Abingdon/ Exton (PA)/ Tokyo. Comput. (1998).. (2009). Yusufoglu.Z and Hasan. Ha. An after treatment technique for improving the accuracy of Adomian’s decomposition method. Babolian. Applied Mathematics and Computation. (1995). Therefore. Applied Mathematical Sciences. M. Hosseini. I.. Math. H. Numerically solution of fuzzy differential equations by Adomian methods. Kluwer. (2010). C. (2002). Yamamoto.8.K. Abdul Majid Wazwaz. Khuri. Dordrecht. By referring to the result found in this study. 473-477. Javadi.Z and Hasan. A. Y. J. T. we conclude that the meaningful starting point is at r = 0. [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] . Iranian Journal of Optimization 1. Math. Numerical solution of Duffing’s equation by the laplace decomposition algorithm.Solving fuzzy Duffing’s equation 2943 the uncertainties and vagueness in the values of the initial conditions. and Comp. Sains Malaysiana 40(6). (2007).. References [1] Abdul Majid Wazwaz. Applied Mathematics and Computation 186. On Lyapunov control of the Duffing equation. M. 547-557. S. 177. (2011).A. Dang. 43. E. Solution of fuzzy differential equations under generalized differentiability by Adomian decomposition Method. Jamshidi. A. Appl. M. 57-75. Solving frontier problems of physics: The decomposition method. Hijmeijer. IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications. 149. Panteley and H. LTDM approach will be taken into consideration as an alternative method to overcome this situation. Control of the chaotic Duffing’s equation with uncertainty in all parameters. Math. 45(12). G. 4(51). 1(4). Appl. L. A new Fuzzy version of Euler’s method for solving differential equations with fuzzy initial values. S. Berghuis. (2002).S. A. Adomian. E. Aminataei. H. 37-44. J. Ahmad. Applied Mathematics and Computation 97. In solving fuzzy Duffing’s equation.A. 25092520. Sh. 572-580. we can get better approximation for this type of equations faster. Nijmeijer and H. A Laplace decomposition algorithm applied to a class of nonlinear differential equations. A new approach to incorporate uncertainty into Euler’s method. Loria. (2001). (2006). E. Jiao. Sadeghi. (1994). Allahviranloo.. Ahmad. Appl. 42. Y. A comparison between Adomian decomposition and Taylor series method in the series solution. The comparison of the stability of Adomian decomposition method with numerical methods of equation solution. 783-798.. (1998). (2004). M.

Comput.2944 Noor'ani Ahmad et al [14] Y. Eugene. 1-27. 56. Applied Math. 2012 . Received: January. (1993). Application of the decomposition method to the solution of the reaction convection diffusion equation.