# The Time-Fractional Coupled-Korteweg-de-Vries Equations

Authors: Abdon Atangana; Aydin Secer
Journal: Abstract and Applied Analysis
 (2013)

---

## Abstract

We put into practice a relatively new analytical technique, the homotopy decomposition method, for solving the nonlinear fractional coupled-Korteweg-de-Vries equations. Numerical solutions are given, and some properties exhibit reasonable dependence on the fractional-order derivatives’ values. The fractional derivatives are described in the Caputo sense. The reliability of HDM and the reduction in computations give HDM a wider applicability. In addition, the calculations involved in HDM are very simple and straightforward. It is demonstrated that HDM is a powerful and efficient tool for FPDEs. It was also demonstrated that HDM is more efficient than the adomian decomposition method (ADM), variational iteration method (VIM),  homotopy analysis method (HAM), and  homotopy perturbation method (HPM).


---

## Body

## 1. Introduction

Fractional calculus has been used to model physical and engineering processes, which are found to be best described by fractional differential equations. It is worth nothing that the standard mathematical models of integer-order derivatives, including nonlinear models, do not work adequately in many cases. In the recent years, fractional calculus has played a very important role in various fields such as mechanics, electricity, chemistry, biology, economics, notably control theory, signal image processing, and groundwater problems. In the past several decades, the investigation of travelling-wave solutions for nonlinear equations has played an important role in the study of nonlinear physical phenomena. In [1], homotopy analysis method is applied to obtain approximate analytical solution of the modified Kuramoto-Sivashinsky equation. In addition to that an excellent literature of this can be found in [2–11]. Analytical solutions of these equations are usually not available. Since only limited classes of equations are solved by analytical means, numerical solution of these nonlinear partial differential equations is of practical importance.In this paper, we extend the application of the homotopy decomposition method (HDM) in order to derive analytical approximate solutions to nonlinear time-fractional coupled-KDV equations. This coupled system is used to describe iterations of water waves proposed by Hirota and Satsuma [12]. The HDM was recently applied to solve the fractional modified Kawahara equation, fractional model of HIV infection of CD4+T cells, the attractor fractional one-dimensional Keller-Segel equations, the fractional Jaulent-Miodek and Whitham-Broer-Kaup equations, the fractional Riccati differential equation, fractional nonlinear predator-prey population, and the fractional nonlinear system predator-prey population. The relatively new technique that approached the HDM is a promising analytical technique to solve nonlinear fractional partial and ordinary differential equations. The fractional systems of partial differential equations under investigation here are given as
(1)∂αu(x,t)∂tα+6au(x,t)ux(x,t)-2bv(x,t)vx(x,t)+aux,x,x(x,t)=0,0<α≤1,∂βv(x,t)∂tβ+3bu(x,t)vx(x,t)+bvx,x,x(x,t)=0,0<β≤1.
Subject to the initial conditions
(2)u(x,0)=λa(sech(12λax))2,v(x,0)=λ2a(sech(12λax))2.
The remaining of this paper is structured as follows: in Section 2 we present a brief history of the fractional derivative order and their properties. We present the basic ideal of the homotopy decomposition method for solving high-order nonlinear fractional partial differential equations. We present the application of the HDM for system fractional nonlinear differential equations (1) and numerical results in Section 4. The conclusions are then given in Section 5.


## 2. Fractional Derivative Order

### 2.1. Brief History

In the literature, one can find several definitions of fractional derivatives. The most common used are the Riemann-Liouville and the Caputo derivatives. For Caputo we have(3)D0Cxα(f(x))=1Γ(n-α)∫0x(x-t)n-α-1dnf(t)dtndt.
For the case of Riemann-Liouville we have the following definition:
(4)Dxα(f(x))=1Γ(n-α)dndxn∫0x(x-t)n-α-1f(t)dt.
Each fractional derivative presents some advantages and disadvantages [13, 14]. The Riemann-Liouville derivative of a constant is not zero while Caputo’s derivative of a constant is zero but demands higher conditions of regularity for differentiability: to compute the fractional derivative of a function in the Caputo sense, we must first calculate its derivative. Caputo derivatives are defined only for differentiable functions while functions that have no first-order derivative might have fractional derivatives of all orders less than one in the Riemann-Liouville sense [15, 16]. Recently, Jumarie (see [17, 18]) proposed a simple alternative definition to the Riemann-Liouville derivative:
(5)Dxα(f(x))=1Γ(n-α)dndxn∫0x(x-t)n-α-1{f(t)-f(0)}dt.
His modified Riemann-Liouville derivative seems to have advantages of both the standard Riemann-Liouville and Caputo fractional derivatives: it is defined for arbitrary continuous (nondifferentiable) functions and the fractional derivative of a constant is equal to zero. However, the Jumarie fractional derivative gives the fractional derivative of f(x)-f(0) not for f(x), this implies that, there is no fractional derivative for some functions that are not defined at the origin, for instance ln(x) [19].We can point out that Caputo and Riemann-Liouville may have their disadvantages but they still remain the best definitions of the fractional derivative. Every definition must be used accordingly [19].


### 2.2. Properties and Definitions

Definition 1.
A real functionf(x),x>0 is said to be in the space Cμ,μ∈ℝ if there exists a real number p>µ, such that f(x)=xph(x), where h(x)∈C[0,∞), and it is said to be in space Cμm if  f(m)∈Cμ,m∈ℕ.Definition 2.
The Riemann-Liouville fractional integral operator of orderα≥0, of a function f∈Cμ,μ≥-1, is defined as
(6)Jαf(x)=1Γ(α)∫0x(x-t)α-1f(t)dt,α>0,x>0,J0f(x)=f(x).
Properties of the operator can be found in [15, 16], and one mentions only the following:
forf∈Cμ,μ≥-1,α,β≥0, andγ>-1:
(7)JαJβf(x)=Jα+βf(x),JαJβf(x)=JβJαf(x)Jαxγ=Γ(γ+1)Γ(α+γ+1)xα+γ.Lemma 3.
Ifm-1<α≤m,m∈ℕ  and f∈Cμm,μ≥-1,then
(8)DαJαf(x)=f(x),JαD0αf(x)=f(x)-∑k=0m-1f(k)(0+)xkk!,x>0.Definition 4 (partial derivatives of fractional order).
Assume now thatf(x) is a function of n variables xi,i=1,…,n also of class C on D∈ℝn. As an extension of Definition 4, one defines partial derivative of order α for f with respect to xi the function
(9)a∂x_αf=1Γ(m-α)∫axi(xi-t)m-α-1∂ximf(xj)|xj=tdt,
if it exists, where  ∂xim  is the usual partial derivative of integer-order m.


## 2.1. Brief History

In the literature, one can find several definitions of fractional derivatives. The most common used are the Riemann-Liouville and the Caputo derivatives. For Caputo we have(3)D0Cxα(f(x))=1Γ(n-α)∫0x(x-t)n-α-1dnf(t)dtndt.
For the case of Riemann-Liouville we have the following definition:
(4)Dxα(f(x))=1Γ(n-α)dndxn∫0x(x-t)n-α-1f(t)dt.
Each fractional derivative presents some advantages and disadvantages [13, 14]. The Riemann-Liouville derivative of a constant is not zero while Caputo’s derivative of a constant is zero but demands higher conditions of regularity for differentiability: to compute the fractional derivative of a function in the Caputo sense, we must first calculate its derivative. Caputo derivatives are defined only for differentiable functions while functions that have no first-order derivative might have fractional derivatives of all orders less than one in the Riemann-Liouville sense [15, 16]. Recently, Jumarie (see [17, 18]) proposed a simple alternative definition to the Riemann-Liouville derivative:
(5)Dxα(f(x))=1Γ(n-α)dndxn∫0x(x-t)n-α-1{f(t)-f(0)}dt.
His modified Riemann-Liouville derivative seems to have advantages of both the standard Riemann-Liouville and Caputo fractional derivatives: it is defined for arbitrary continuous (nondifferentiable) functions and the fractional derivative of a constant is equal to zero. However, the Jumarie fractional derivative gives the fractional derivative of f(x)-f(0) not for f(x), this implies that, there is no fractional derivative for some functions that are not defined at the origin, for instance ln(x) [19].We can point out that Caputo and Riemann-Liouville may have their disadvantages but they still remain the best definitions of the fractional derivative. Every definition must be used accordingly [19].


## 2.2. Properties and Definitions

Definition 1.
A real functionf(x),x>0 is said to be in the space Cμ,μ∈ℝ if there exists a real number p>µ, such that f(x)=xph(x), where h(x)∈C[0,∞), and it is said to be in space Cμm if  f(m)∈Cμ,m∈ℕ.Definition 2.
The Riemann-Liouville fractional integral operator of orderα≥0, of a function f∈Cμ,μ≥-1, is defined as
(6)Jαf(x)=1Γ(α)∫0x(x-t)α-1f(t)dt,α>0,x>0,J0f(x)=f(x).
Properties of the operator can be found in [15, 16], and one mentions only the following:
forf∈Cμ,μ≥-1,α,β≥0, andγ>-1:
(7)JαJβf(x)=Jα+βf(x),JαJβf(x)=JβJαf(x)Jαxγ=Γ(γ+1)Γ(α+γ+1)xα+γ.Lemma 3.
Ifm-1<α≤m,m∈ℕ  and f∈Cμm,μ≥-1,then
(8)DαJαf(x)=f(x),JαD0αf(x)=f(x)-∑k=0m-1f(k)(0+)xkk!,x>0.Definition 4 (partial derivatives of fractional order).
Assume now thatf(x) is a function of n variables xi,i=1,…,n also of class C on D∈ℝn. As an extension of Definition 4, one defines partial derivative of order α for f with respect to xi the function
(9)a∂x_αf=1Γ(m-α)∫axi(xi-t)m-α-1∂ximf(xj)|xj=tdt,
if it exists, where  ∂xim  is the usual partial derivative of integer-order m.


## 3. Basic Idea of the HDM

To illustrate the basic idea of this method, we consider a general nonlinear nonhomogeneous fractional partial differential equation with initial conditions of the following form:(10)∂αU(x,t)∂tα=L(U(x,t))+N(U(x,t))+f(x,t),α>0.
Subject to the initial condition
(11)D0α-kU(x,0)=fk(x),(k=0,…,n-1),D0α-nU(x,0)=0,n=[α],D0kU(x,0)=gk(x),(k=0,…,n-1),D0nU(x,0)=0,n=[α],
where ∂α/∂tα  denotes the Caputo or Riemann-Liouville fraction derivative operator, f is a known function, N is the general nonlinear fractional differential operator, and L represents a linear fractional differential operator. The method first step here is to transform the fractional partial differential equation to the fractional partial integral equation by applying the inverse operator  ∂α/∂tα of both sides of (10) to obtain the following. In the case of Riemann-Liouville fractional derivative
(12)U(x,t)=∑j=1n-1fj(x)Γ(α-j+1)tα-j+1Γ(α)∫0t(t-τ)α-1[{∫}L(U(x,τ))+N(U(x,τ))+1Γ(α)+f(x,τ){∫}]dτ.
In the case of Caputo fractional derivative
(13)U(x,t)=∑j=1n-1gj(x)Γ(α-j+1)tj+1Γ(α)∫0t(t-τ)α-1[{∫}L(U(x,τ))+N(U(x,τ))+f(x,τ){∫}]dτ,
or in general by putting
(14)∑j=1n-1fj(x)Γ(α-j+1)tα-j=f(x,t)orf(x,t)=∑j=1n-1gj(x)Γ(α-j+1)tj,
we obtain the following:
(15)U(x,t)=T(x,t)+1Γ(α)∫0t(t-τ)α-1[{∫}L(U(x,τ))+N(U(x,τ))+f(x,τ){∫}]dτ.
In the homotopy decomposition method, the basic assumption is that the solutions can be written as a power series in p(16a)U(x,t,p)=∑n=0∞pnUn(x,t),(16b)U(x,t)=limp→1U(x,t,p),and the nonlinear term can be decomposed as(17)NU(x,t)=∑n=0∞pnℋn(U),
where p∈(0,1] is an embedding parameter. ℋn(U) is the He’s polynomials that can be generated by
(18)ℋn(U0,…,Un)=1n!∂n∂pn[N(∑j=0∞pjUj(x,t))],n=0,1,2,….
The homotopy decomposition method is obtained by the graceful coupling of homotopy technique with the Abel integral and is given by
(19)∑n=0∞pnUn(x,t)-T(x,t)=pΓ(α)∫0t(t-τ)α-1[f(x,τ)+L(∑n=0∞pnUn(x,τ))+N(∑n=0∞pnUn(x,τ))]dτ.
Comparison of the terms of same powers of p gives solutions of various orders with the first term:
(20)U0(x,t)=T(x,t).


### 3.1. Convergence of the Method and Unicity of the Solution

Theorem 5 (see [19]).
Assuming thatX×T⊂ℝ×ℝ+ is a Banach space with a well-defined norm ∥·∥, over which the series sequence of the approximate solution of (1) is defined, and the operator G(Un(x,t))=Un+1(x,t) defining the series solution of (16b) satisfies the Lipschitzian conditions that is ∥G(Uk*)-G(Uk)∥≤ε∥Uk*(x,t)-Uk(x,t)∥ for all (x,t,k)∈X×T×ℕ, then series solution obtained (16b) is unique.Proof.
Assume thatU(x,t) and U*(x,t) are the series solution satisfying (1), then U*(x,t,p)=∑n=0∞pnUn*(x,t)  with initial guess  T(x,t); U(x,t,p)=∑n=0∞pnUn(x,t) also with initial guess T(x,t); therefore,
(21)∥Un*(x,t)-Un(x,t)∥=0,n=0,1,2,….
By the recurrence for n=0,Un*(x,t)=Un(x,t)=T(x,t), assume that for n>k≥0,  ∥Uk*(x,t)-Uk(x,t)∥=0. Then
(22)∥Uk+1*(x,t)-Uk+1(x,t)∥=∥G(Uk*)-G(Uk)∥≤ε∥Uk*(x,t)-Uk(x,t)∥=0,
which completes the proof.


### 3.2. Complexity of the Homotopy Decomposition Method

It is very important to test the computational complexity of a method or algorithm. Complexity of an algorithm is the study of how long a program will take to run, depending on the size of its input and long of loops made inside the code. We compute a numerical example which is solved by the homotopy decomposition method. The code has been presented with Mathematica 8 according to the following code [19].Step 1.
Setm←0.Step 2.
Calculating the recursive relation after the comparison of the terms of the same power is done.Step 3.
If∥Un+1(x,t)-Un(x,t)∥<r with r the ratio of the neighbourhood of the exact solution [5] then go to Step 4, else m←m+1 and go to Step 2Step 4.
Print out(23)U(x,t)=∑n=0∞Un(x,t),
as the approximate of the exact solution.Lemma 6.
If the exact solution of the fractional partial differential equation (10) exists, then
(24)∥Un+1(x,t)-Un(x,t)∥<r∀(x,t)∈X×T.Proof.
Let(x,t)∈X×T, then since the exact solution exists, then we have that following:
(25)∥Un+1(x,t)-Un(x,t)∥=∥Un+1(x,t)-U(x,t)+U(x,t)-Un(x,t)∥≤∥Un+1(x,t)-U(x,t)∥+∥-Un(x,t)+U(x,t)∥≤r2+r2=r.
The last inequality follows from [19].Lemma 7.
The complexity of the homotopy decomposition method is of orderO(n).Proof.
The number of computations including product, addition, subtraction, and division are in Step2Uo: is 0 because, it is obtained directly form the initial guess T(x,t) [19].U1: 3⋮Un: 3.Now in Step 4, the total number of computations is equal to   ∑j=0nUj(x,t)=3n=O(n).


## 3.1. Convergence of the Method and Unicity of the Solution

Theorem 5 (see [19]).
Assuming thatX×T⊂ℝ×ℝ+ is a Banach space with a well-defined norm ∥·∥, over which the series sequence of the approximate solution of (1) is defined, and the operator G(Un(x,t))=Un+1(x,t) defining the series solution of (16b) satisfies the Lipschitzian conditions that is ∥G(Uk*)-G(Uk)∥≤ε∥Uk*(x,t)-Uk(x,t)∥ for all (x,t,k)∈X×T×ℕ, then series solution obtained (16b) is unique.Proof.
Assume thatU(x,t) and U*(x,t) are the series solution satisfying (1), then U*(x,t,p)=∑n=0∞pnUn*(x,t)  with initial guess  T(x,t); U(x,t,p)=∑n=0∞pnUn(x,t) also with initial guess T(x,t); therefore,
(21)∥Un*(x,t)-Un(x,t)∥=0,n=0,1,2,….
By the recurrence for n=0,Un*(x,t)=Un(x,t)=T(x,t), assume that for n>k≥0,  ∥Uk*(x,t)-Uk(x,t)∥=0. Then
(22)∥Uk+1*(x,t)-Uk+1(x,t)∥=∥G(Uk*)-G(Uk)∥≤ε∥Uk*(x,t)-Uk(x,t)∥=0,
which completes the proof.


## 3.2. Complexity of the Homotopy Decomposition Method

It is very important to test the computational complexity of a method or algorithm. Complexity of an algorithm is the study of how long a program will take to run, depending on the size of its input and long of loops made inside the code. We compute a numerical example which is solved by the homotopy decomposition method. The code has been presented with Mathematica 8 according to the following code [19].Step 1.
Setm←0.Step 2.
Calculating the recursive relation after the comparison of the terms of the same power is done.Step 3.
If∥Un+1(x,t)-Un(x,t)∥<r with r the ratio of the neighbourhood of the exact solution [5] then go to Step 4, else m←m+1 and go to Step 2Step 4.
Print out(23)U(x,t)=∑n=0∞Un(x,t),
as the approximate of the exact solution.Lemma 6.
If the exact solution of the fractional partial differential equation (10) exists, then
(24)∥Un+1(x,t)-Un(x,t)∥<r∀(x,t)∈X×T.Proof.
Let(x,t)∈X×T, then since the exact solution exists, then we have that following:
(25)∥Un+1(x,t)-Un(x,t)∥=∥Un+1(x,t)-U(x,t)+U(x,t)-Un(x,t)∥≤∥Un+1(x,t)-U(x,t)∥+∥-Un(x,t)+U(x,t)∥≤r2+r2=r.
The last inequality follows from [19].Lemma 7.
The complexity of the homotopy decomposition method is of orderO(n).Proof.
The number of computations including product, addition, subtraction, and division are in Step2Uo: is 0 because, it is obtained directly form the initial guess T(x,t) [19].U1: 3⋮Un: 3.Now in Step 4, the total number of computations is equal to   ∑j=0nUj(x,t)=3n=O(n).


## 4. Application

In learning science, examples are useful than rules (Isaac Newton). In this section, we apply this method for solving system of fractional differential equation. Following carefully the steps involved in the HDM, we arrive at the following equations:(26)∑n=0∞pnun(x,t)=u(x,0)-pΓ(α)∫0t(t-τ)α-1(6a∑n=0∞pnun(∑n=0∞pnun)x-pΓ(α)(t-τ)α-1-2b∑n=0∞pnvn(∑n=0∞pnvn)x)+(∑n=0∞pnun)x,x,x,∑n=0∞pnvn(x,t)=v(x,0)-pΓ(β)∫0t(t-τ)β-1((6a∑n=0∞pnun(∑n=0∞pnun)x+3b∑n=0∞pnun(∑n=0∞pnvn)x)×b(∑n=0∞pnun)x,x,x).
If we compare the terms of the same power of p  we obtain the following integral equations. Note that when comparing this approach with the methodology of the homotopy perturbation method, one will obtain in this step a set of ordinary differential equations something which needs to be also solved with care, because one will need to choose an appropriate initial guest. But with the current approach, the initial guess is straightforwardly obtained as the Taylor series of the exact solution of the problem under investigation; this is one of the advantages that the approach has over the HPM [22]. On the other hand, when comparing this approach with the variational iteration method [23], one will find out that we do need the Lagrange multiplier here or the correctional function. Also this approach provides us with a convenient way to control the convergence of approximation series without adapting h, as in the case of [24] which is a fundamental qualitative difference in analysis between HDM and other methods. Therefore, comparing the terms of the same power we obtain
(27)p0:u0(x,t)=u(x,0),u0(x,0)=u(x,0),p0:u0(x,t)=u(x,0),u0(x,0)=u(x,0),p1:u1(x,t)=-1Γ(α)×∫0t(t-τ)α-1(6au0(u0)x-2bv0(v0)x+a(u0)xxx)dτ,=-1Γ(α)∫0t(t-τ)α-1u1(x,0)=0,p1:v1(x,t)=-1Γ(β)∫0t(t-τ)β-1×(3bu0(v0)x+b(u0)xxx)dτ,v1(x,0)=0,⋮pn:un(x,t)=-1Γ(α)∫0t(t-τ)α-1×(6a∑i=0n-1ui(un-i-1)x-2b∑i=0n-1vi(vn-i-1)x+a(un-1)xxx{∑i=0n-1ui(un-i-1)x-2b∑i=0n-1vi(vn-i-1)x})dτ,un(x,t)=0,pn:vn(x,t)=-1Γ(α)∫0t(t-τ)α-1×(3b∑i=0n-1ui(vn-i-1)x+b(vn-1)xxx)dτ,=-1Γ(α)∫0t(t-τ)α-1vn(x,t)=0.
Integrating the above, we obtain the following series solutions:
(28)u0(x,t)=λa(sech(12λax))2,v0(x,t)=λ2a(sech(12λax))2.
For the sake of simplicity we put the following:
(29)d=λa,d1=λ2a,m=12λa,u1(x,t)=4mtαΓ(1+α)×(-bd12+ad(3d-5m2)+adm2cosh(2mx))×(sech(mx))4tanh(mx),v1(x,t)=2bd1mtβΓ(1+β)(3d-10m2+2m2cosh(2mx))×(sech(mx))4tanh(mx),u2(x,t)=1Γ(1+α)Γ(1+β)Γ(0.5+α)Γ(1+α+β)×(21-2αm2πtαΓ(1+β)×(-2b2d12tβ×(-12d+44m2+(9d-38m2)×cosh(2mx)+2m2cosh(4mx)×Γ(1+2α)+atα×(-8(2bd12(-3d+13m2)+ad(18d2-111dm2+151m4))+(4bd12(-9d+49m2)+3ad(36d2-272dm2+397m4))×cosh(2mx)-4m2(4bd12-15ad(d-2m2))×cosh(4mx)+adm4cosh(6xm)-8(2bd12(-3d+13m2))×Γ(1+α+β){(-12d+44m2+(9d-38m2)})(sech(mx))8)),v2(x,t)=1Γ(1+α)Γ(1+β)Γ(0.5+α)Γ(1+α+β)×(21-2βm2πtβΓ(1+α)(sech(mx))8×(btβ(-27d2+411dm2-1208m4+3(6d2-124dm2+397m4)×cosh(2mx)+3m2(9d-40m2)×cosh(4mx)+m4cosh(6mx))×Γ(1+α+β)+12tα(-bd12+ad(3d-5m2)+adm2cosh(2mx))Γ(1+2β)×(sinh(mx))2)).
And so on, using the package Mathematica, in the same manner, one can obtain the rest of the components. But, here, few terms were computed and the asymptotic solution is given by the following:
(30)u(x,t)=u0(x,t)+u1(x,t)+u2(x,t)+u3(x,t)+⋯,v(x,t)=v0(x,t)+v1(x,t)+v2(x,t)+v3(x,t)+⋯.


### 4.1. Numerical Solutions

The following figures show the graphical representation of the approximated solution of the system of the time-fractional coupled-Korteweg-de-Vries equations forλ=1,a=b=1.Note that the below figure show that the coupled solution of KDV equation is not only the function of time and space but also an increasing function of the fractional order derivative, which areα and β. The approximate solution of main problem has been depicted in Figures 1, 2, 3, and 4 which is plotted in Mathematica according to different α  and β values.Figure 1
Approximate solution forα=0.75 and β=0.45.Figure 2
Approximate solution forα=0.75 and β=0.45.Figure 3
Approximate solution forα=1 and β=0.9.Figure 4
Approximate solution forα=1 and β=1.It is important to note that ifα=β,a=1, and  b=3, the exact solution of the coupled-KDV equations is given as
(31)u(x,0)=λa(sech(12λax-λt))2,v(x,0)=λ2a(sech(12λax-λt))2.
Thus, to test the accuracy of the relatively new analytical technique, we represent in Table 1 the numerical values of the approximate and the exact solutions and the results obtained in [20].Table 1
Numerical values of the approximate, exact solutions and the results obtained in [20, 21].
x
t
u
(
x
,
t
) exact
u
(
x
,
t
) approximate
[20]
Error for [20]
Error approx
−10
0.1
0.000164305
0.000164334
0.000164384
2.99039
×
10
-
8
2.95039
×
10
-
8
0.2
0.00014867
0.000148901
0.000148991
2.33335
×
10
-
7
2.30335
×
10
-
7
−5
0.1
0.0240923
0.0240963
0.02409673
3.96592
×
10
-
6
3.93592
×
10
-
6
0.2
0.0218248
0.0218556
0.02185586
0.0000338049
0.0000308049
5
0.1
0.0240923
0.0240963
0.02409653
3.97592
×
10
-
6
3.93592
×
10
-
6
0.2
0.0218248
0.0218556
0.02185576
0.0000378049
0.0000308049
10
0.1
0.000164305
0.000164334
0.000164344
2.96039
×
10
-
8
2.95039
×
10
-
8
0.2
0.00014867
0.000148901
0.000148931
2.37335
×
10
2.30335
×
10
-
7
x
t
v
(
x
,
t
) exact
v
(
x
,
t
) approximate
[20]
Error for [20]
Error
−10
0.1
0.000116181
0.000116202
0.000116232
2.18624
×
10
-
8
2.08624
×
10
-
8
0.2
0.000105126
0.000105289
0.000105259
1.64872
×
10
-
7
1.62872
×
10
-
7
−5
0.1
0.170358
0.0170386
0.0170387
2.88312
×
10
-
6
2.78312
×
10
-
6
0.2
0.0154325
0.0154542
0.0154552
0.0000287824
0.0000217824
5
0.1
0.170358
0.0170386
0.0170389
2.98312
×
10
-
6
2.78312
×
10
-
6
0.2
0.0154325
0.0154542
0.0154562
0.0000247824
0.0000217824
10
0.1
0.000116181
0.000116202
0.000116252
2.09624
×
10
-
8
2.08624
×
10
-
8
0.2
0.000105126
0.000105289
0.000105299
1.72872
×
10
-
7
1.62872
×
10
-
7Table1 comparison shows that the solutions obtained in this paper are more accurate than those obtained in [20].


## 4.1. Numerical Solutions

The following figures show the graphical representation of the approximated solution of the system of the time-fractional coupled-Korteweg-de-Vries equations forλ=1,a=b=1.Note that the below figure show that the coupled solution of KDV equation is not only the function of time and space but also an increasing function of the fractional order derivative, which areα and β. The approximate solution of main problem has been depicted in Figures 1, 2, 3, and 4 which is plotted in Mathematica according to different α  and β values.Figure 1
Approximate solution forα=0.75 and β=0.45.Figure 2
Approximate solution forα=0.75 and β=0.45.Figure 3
Approximate solution forα=1 and β=0.9.Figure 4
Approximate solution forα=1 and β=1.It is important to note that ifα=β,a=1, and  b=3, the exact solution of the coupled-KDV equations is given as
(31)u(x,0)=λa(sech(12λax-λt))2,v(x,0)=λ2a(sech(12λax-λt))2.
Thus, to test the accuracy of the relatively new analytical technique, we represent in Table 1 the numerical values of the approximate and the exact solutions and the results obtained in [20].Table 1
Numerical values of the approximate, exact solutions and the results obtained in [20, 21].
x
t
u
(
x
,
t
) exact
u
(
x
,
t
) approximate
[20]
Error for [20]
Error approx
−10
0.1
0.000164305
0.000164334
0.000164384
2.99039
×
10
-
8
2.95039
×
10
-
8
0.2
0.00014867
0.000148901
0.000148991
2.33335
×
10
-
7
2.30335
×
10
-
7
−5
0.1
0.0240923
0.0240963
0.02409673
3.96592
×
10
-
6
3.93592
×
10
-
6
0.2
0.0218248
0.0218556
0.02185586
0.0000338049
0.0000308049
5
0.1
0.0240923
0.0240963
0.02409653
3.97592
×
10
-
6
3.93592
×
10
-
6
0.2
0.0218248
0.0218556
0.02185576
0.0000378049
0.0000308049
10
0.1
0.000164305
0.000164334
0.000164344
2.96039
×
10
-
8
2.95039
×
10
-
8
0.2
0.00014867
0.000148901
0.000148931
2.37335
×
10
2.30335
×
10
-
7
x
t
v
(
x
,
t
) exact
v
(
x
,
t
) approximate
[20]
Error for [20]
Error
−10
0.1
0.000116181
0.000116202
0.000116232
2.18624
×
10
-
8
2.08624
×
10
-
8
0.2
0.000105126
0.000105289
0.000105259
1.64872
×
10
-
7
1.62872
×
10
-
7
−5
0.1
0.170358
0.0170386
0.0170387
2.88312
×
10
-
6
2.78312
×
10
-
6
0.2
0.0154325
0.0154542
0.0154552
0.0000287824
0.0000217824
5
0.1
0.170358
0.0170386
0.0170389
2.98312
×
10
-
6
2.78312
×
10
-
6
0.2
0.0154325
0.0154542
0.0154562
0.0000247824
0.0000217824
10
0.1
0.000116181
0.000116202
0.000116252
2.09624
×
10
-
8
2.08624
×
10
-
8
0.2
0.000105126
0.000105289
0.000105299
1.72872
×
10
-
7
1.62872
×
10
-
7Table1 comparison shows that the solutions obtained in this paper are more accurate than those obtained in [20].


## 5. Conclusions

We derived approximated solutions of nonlinear fractional-coupled KDV equations using the relatively new analytical technique, the HDM. We presented the brief history and some properties of fractional derivative concept. It is demonstrated that HDM is a powerful and efficient tool of FPDEs. In addition, the calculations involved in HDM are very simple and straightforward. Comparing the methodology HDM to HPM, ADM [25], VIM, and HAM have the advantages. Disparate the ADM, the HDM is free from the need to use the Adomian polynomials. In this method, we do not need the Lagrange multiplier, correction functional, stationary conditions, or calculating heavy integrals, as the solutions obtained are noise free [26], which eliminate the complications that exist in the VIM. In contrast to the HAM, this method is not required to solve the functional equations in iteration since the efficiency of HAM is very much dependant on choosing auxiliary parameter. In contract to HPM, we do not need to continuously deform a difficult problem to another that is easier to solve. We can easily conclude that the homotopy decomposition method is a well-organized analytical method for solving exact and approximate solutions of nonlinear fractional partial differential equations.



---

*Source: 947986-2013-03-19.xml*