Next Article in Journal
Application of the Wave Propagation Approach to Sandwich Structures: Vibro-Acoustic Properties of Aluminum Honeycomb Materials
Previous Article in Journal
Parameter Determination of a Minimal Model for Brake Squeal
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite Difference/Collocation Method for a Generalized Time-Fractional KdV Equation

School of Mathematics and Statistics, Central South University, 932 Lushan South Road, Changsha 410083, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Appl. Sci. 2018, 8(1), 42; https://doi.org/10.3390/app8010042
Submission received: 1 November 2017 / Revised: 27 December 2017 / Accepted: 28 December 2017 / Published: 1 January 2018

Abstract

:
In this paper, we studied the numerical solution of a time-fractional Korteweg–de Vries (KdV) equation with new generalized fractional derivative proposed recently. The fractional derivative employed in this paper was defined in Caputo sense and contained a scale function and a weight function. A finite difference/collocation scheme based on Jacobi–Gauss–Lobatto (JGL) nodes was applied to solve this equation and the corresponding stability was analyzed theoretically, while the convergence was verified numerically. Furthermore, we investigated the behavior of solution of the generalized KdV equation depending on its parameter δ , scale function z ( t ) in fractional derivative. We found that the full discrete scheme was effective to obtain a numerical solution of the new KdV equation with different conditions. The wave number δ in front of the third order space derivative term played a significant role in splitting a soliton wave into multiple small pieces.

1. Introduction

The study of nonlinear phenomena has always been an active subject in applied science and physics. As a classic nonlinear partial differential equation, the Korteweg-de Vires (KdV) equation is very important in analyzing waves on shallow water surfaces. In history, the KdV equation was first introduced by Boussinesq around 1877, and rediscovered by Diederik Korteweg and Gustav de Vries in 1895 [1]. The KdV equation was firstly derived as an evolution equation that governs small-amplitude, long-surface gravity waves propagating in a shallow channel of water. However, the KdV equation can only be solved analytically in selected initial and boundary conditions due to its nonlinearity [2,3,4,5]. With the development of computational techniques, the KdV equation gained much attention of mathematicians and physicists in the past few years. In [6], by choosing appropriate base functions, a Legendre–Petrov–Galerkin method is applied for the KdV equation. An optimal rate of convergence in L 2 -norm is derived without the nonlinear part. By using different test and trial function spaces and basis functions, [7] proposes a new dual-Petrov–Galerkin method for high odd-order differential equations. In [8], pseudo-spectral method is applied to solve the KdV equation, in which the spectral method is implemented parallelled with split-step. This is one of the original results of the pseudo-spectral method applied to the KdV equation. Later in [9], the KdV equation is solved by the homotopy perturbation method. By constructing special forms of initial conditions, numerical solutions expressed by the trigonometric functions, hyperbolic functions are obtained. Many authors applied the collocation method to solve KdV equation due to its high accuracy and good performance in the nonlinear case. In [10], the KdV equation is solved by using the radial basis functions. It is a meshless method based on the collocation with radial basis functions. Five standard radial basis functions are used in the method of the collocation. In [11], A KdV–Burgers equation was discussed by using the modified Bernstein polynomials. The B-polynomials were used to expand the desired solution requiring discretization with only the time variable. The Galerkin method was used to determine the expansion coefficients to construct initial trial functions. A fourth-order Runge–Kutta method was used to solve the system of equations for the time variable. In [12], the sinc-collocation method was applied to solve the nonlinear third-order KdV equation in the space direction with periodic forcing at the boundary numerically and a θ -weight finite difference method was used to approximate the first-order time derivative. However, all the work above is on the KdV equation with integer-order derivatives. In the recent forty years, many partial differential equations are reconsidered by changing their classical derivative into fractional derivatives.
Fractional derivative is not a new concept. In fact, it was firstly proposed in the discussion of Leibniz and l’Hospital in 1695. Since 1974, when the first international conference of fractional calculus and its application was held, many researchers from scientific and engineering fields brought fractional derivatives back to their research interests. A large number of physical models were renewed by fractional calculus. Under such a background, fractional KdV equation, as well as many other fractional PDEs, are also studied by different methods, either analytical or numerical techniques [13,14,15,16]. In [17], a fractional KdV equation with a Caputo derivative is solved by the Adomian decomposition method. The approximation solution is presented via a convergent series with easily computable components. In [18], based on Maple, the Adomian decomposition method is extended to derive explicit and numerical solutions of the fractional KdV–Burgers equation. In [19], the homotopy analysis method that was developed for integer-order differential equations is directly extended to derive explicit and numerical solutions of the nonlinear fractional KdV equation. In [20], the homotopy perturbation method is implemented to construct solitary solutions for variants of the KdV equations with fractional time derivatives. In this scheme, the solution takes the form of a convergent series, and its terms can be easily calculated via iteration. In a recent work [21], the explicit and approximate solutions of the nonlinear fractional KdV–Burgers equation with time/space-fractional derivatives were presented and discussed. The numerical method is a technique based on the generalized Taylor series formula which constructs an analytical solution in the form of a convergent series. Noting that most of above work is analytical/semianalytical, we are interested in solving the fractional KdV equation numerically by a finite difference/collocation method, and trying to discover some particular features of the soliton solution of the fractional KdV equation.
Fractional derivatives have various definitions, out of which the frequently used ones are defined in Riemann–Liouville and Caputo senses, which can be regarded as a convolution between a fractional power kernel and a function. These kinds of fractional power kernel put more weight in the present than in the past, which is particularly suitable to describe physical processes in the material with short memory, but is incapable of properly describing some behavior observed in materials with huge heterogeneities and structures with different scales. In [22], a new kind of fractional KdV model was established by using the developed Caputo–Fabrizio fractional derivative, and the conditions of existence and uniqueness of the continuous solution were provided. In [23], a time-fractional Shamel–KdV equation with Riesz fractional derivatives was derived to describe nonlinear behavior of dust-ion acoustic waves. In 2012, to unify different existing fractional derivatives, a new fractional calculus was proposed in [24]. Taking a scale function and a weight function into consideration, fractional integrals and derivatives were essentially generalized. Partial differential equations with such generalized fractional derivatives are not studied much [25,26,27,28]. Therefore, in this paper, we choose the KdV equation to further study this topic. By using a generalized derivative with respect to scale function and weight function, we defined a new time-fractional KdV equation. As there is strong nonlinearity in the structure of the KdV equation, the collocation method is applied to the space direction while the finite difference method is implemented in the time direction. Because of the complexity of generalized fractional derivative, some classic mathematical tools are not available anymore in studying the generalized KdV equation, such as variational principle, energy functional, Hölder estimation and Sobolev-type inequalities. We only have very limited methods of theoretical analysis to detect such KdV equations. However, in the current circumstance, the numerical method shall be a useful and direct way to show the details of the considered KdV equation with generalized fractional derivatives. After applying the collocation method in the space direction, the generalized fractional KdV equation is reduced to a nonlinear generalized fractional differential equation with respect to t. Reference [29] studied the existence and uniqueness of a class of generalized fractional boundary value problems by using topological degree theory. In our paper, we focus on numerical methods to analyze such a KdV equation. Thus, we choose initial and boundary conditions that are sufficiently good to guarantee the existence and uniqueness of the new time-fractional KdV equation. We apply a semi-discretization scheme to solve this new fractional KdV. Based on numerical simulation, many new characteristics of the new fractional KdV equation are presented. The remainder of this article is organized as follows: Section 2 is devoted to the preliminaries of generalized fractional calculus. In Section 3, we discuss the numerical scheme and its stability. Two numerical examples are given in Section 4. The first one is calculated to confirm the effectiveness and accuracy of the proposed numerical method. The second one with soliton-type initial condition is used to show important differences between the conventional KdV equation and our generalized fractional KdV equation. Some nonlinear scale functions are considered, which makes the KdV equation more general.

2. Preliminaries of Fractional Calculus and Jacobi Polynomials

2.1. Generalized Fractional Calculus

In this part, we introduce the definitions of new generalized fractional integrals and derivatives. To guarantee that the new generalized fractional integral and derivative are well-defined, we need to assume that the weight function is positive and the scale function is monotonically increasing on the domain.
Definition 1.
([24]) The left-generalized fractional integral of order α > 0 of a function u ( t ) with respect to a scale function z ( t ) and a weight function w ( t ) is defined as
* I a + α u ( t ) = w ( t ) 1 Γ ( α ) a t w ( s ) z ( s ) u ( s ) [ z ( t ) z ( s ) ] 1 α d s ,
provided the integral exists. The superscript `*’ indicates the integral here is a new generalized fractional integral.
Definition 2.
([24]) The left first-order generalized derivative of a function u ( t ) with respect to a scale function z ( t ) and a weight function w ( t ) is defined as
D [ z , w , L ] u ( t ) = [ w ( t ) ] 1 1 z ( t ) D t ( w ( t ) u ( t ) ) ,
provided the right side of the equation is finite.
Definition 3.
([24]) The left-generalized derivative of order m of a function u ( t ) with respect to a scale function z ( t ) and a weight function w ( t ) is defined as
D [ z , w , L ] m u ( t ) = [ w ( t ) ] 1 1 z ( t ) D t m ( w ( t ) u ( t ) ) ,
provided the right side of the equation is finite, where m is a positive integer.
Definition 4.
([24]) The left Caputo-type generalized fractional derivative of order α > 0 of a function u ( t ) with respect to a scale function z ( t ) and a weight function w ( t ) is defined as
* D a + α u ( t ) = * I a + ; [ z , w ] m α D [ z , w , L ] m u ( t ) ,
provided the right side of the equation is finite, where m 1 α < m , m is a positive integer.
Similarly, for one function containing two variables, that is, u ( x , t ) , its (left) Caputo-type generalized fractional partial derivative with respective to t is defined as [25]
* D a + α u ( x , t ) = [ w ( t ) ] 1 Γ ( 1 α ) a t 1 [ z ( t ) z ( s ) ] α · [ w ( s ) u ( x , s ) ] s d s ,   0 < α < 1 .
Remark 1.
Left Riemann–Liouville-type generalized fractional derivatives can be defined if we switch the order of integral and differential. When the scale function is selected as z ( t ) = t and the weight function is a nonzero constant, the operators defined in (1), (4) and left Riemann–Liouville-type generalized fractional derivatives are reduced to left Riemann–Liouville fractional integrals, left Caputo fractional derivatives and left Riemann-Liouville fractional derivatives, respectively.

2.2. Jacobi Polynomials

In recent years, more concentration has been focused on Jacobi polynomials J n β , γ for solving differential equations because the Jacobi parameters β and γ make such polynomials easy to implement. The well-known Jacobi polynomials J n β , γ with indices β , γ > 1 of degree n are defined on interval [ 1 , 1 ] and can be expressed as
J n β , γ x = 1 n 2 n n ! 1 x β 1 + x γ d n d x n 1 x β + n 1 + x γ + n ,
which are solutions of a class of Sturm–Liouville problems [30].
The integer derivative of J n β , γ on the interval [ 1 , 1 ] can be represented in the form
d m d t m J n β , γ x = Γ n + m + β + γ + 1 Γ n + β + γ + 1 2 m J n m β + m , γ + m x .
Let x j , w ˜ j j = 0 N be a set of Jacobi–Gauss–Lobatto nodes and weights. The corresponding discrete inner product, denoted by · , · N , w ˜ , can be defined as
u , v N , w ˜ = j = 0 N u x j v x j w ˜ j .
The exactness of the quadratures implies
u , v N , w ˜ = 1 1 u v w ^ α , β d x = u , v w ^ α , β , u · v P 2 N 1 ,
where P 2 N 1 is denoted by the space of polynomials whose degree does not exceed 2 N 1 .

3. Numerical Scheme and Stability Analysis

The integer-order KdV equation,
u ( x , t ) t + ξ u ( x , t ) u ( x , t ) x + δ 3 u ( x , t ) x 3 = f x , t , ( x , t ) ( a , b ) × ( 0 , T ] ,
is firstly derived to describe one-dimensional shallow-water waves with small but finite amplitudes. Generally, ξ is a positive parameter and δ > 0 indicates the wave number. Replacing the time derivative by the Caputo-type generalized fractional derivative (see (5)), we get
* D a + α u ( x , t ) + ξ u ( x , t ) u ( x , t ) x + δ 3 u ( x , t ) x 3 = f x , t , ( x , t ) ( a , b ) × ( 0 , T ] ,
which is called a generalized fractional KdV equation.
Note that the second term of (10) makes it a nonlinear equation. In order to solve this equation, we impose the following initial and boundary conditions
u ( x , 0 ) = ϕ ( x ) , x [ a , b ] , u ( a , t ) = u ( b , t ) = 0 , u ( b , t ) x = 0 , t [ 0 , T ] .
In the following parts, as a premise, we make an assumption that the problem (10) and (11) is well-posed.

3.1. Numerical Discretization in the Time Direction

To establish a numerical approximation scheme in the time direction, we divide the time domain into M equal parts, where M is a positive integer. Thus Δ t = T M is the time-grid size. We label the successive time nodes as t k = k · ( Δ t ) , k = 0 , 1 , 2 , , M , where t 0 = 0 is the initial time. Assuming w ( t ) > 0 , 0 < α < 1 and z t is strictly monotonic increasing on ( 0 , T ] , then s = z 1 ( η ) by setting η = z ( s ) . The Caputo-type generalized fractional derivative of u ( t ) can be discretized as
* D 0 + α u ( t k ) = [ w ( t k ) ] 1 Γ ( 1 α ) i = 1 k t i 1 t i [ w ( s ) u ( s ) ] [ z ( t k ) z ( s ) ] α d s = [ w ( t k ) ] 1 Γ ( 1 α ) i = 1 k z ( t i 1 ) z ( t i ) 1 z ( t k ) η α · d w ( z 1 ( η ) ) u z 1 ( η ) d z 1 ( η ) d z 1 ( η ) = [ w ( t k ) ] 1 Γ ( 1 α ) i = 1 k w ( t i ) u ( t i ) w ( t i 1 ) u ( t i 1 ) z ( t i ) z ( t i 1 ) z ( t i 1 ) z ( t i ) 1 z ( t k ) η α d η + R k = [ w ( t k ) ] 1 Γ ( 2 α ) i = 1 k a i w ( t i ) u ( t i ) w ( t i 1 ) u ( t i 1 ) + R k
where
a i = z ( t k ) z ( t i 1 ) 1 α z ( t k ) z ( t i ) 1 α z ( t i ) z ( t i 1 ) , i = 1 , 2 , , k ,
and R k is the truncation error given by
R k = w ( t k ) 1 Γ 1 α i = 1 k z i 1 z i 1 z ( t k ) η α d w z 1 η u x , z 1 η d η w ( t i ) u ( t i ) w ( t i 1 ) u ( t i 1 ) z ( t i ) z ( t i 1 ) d η .
Lemma 1.
The coefficients a i , i = 1 , , k , defined as (13), satisfy a k > a k 1 > > a 0 > 0 .
Proof. 
According to the mean-value theorem of integrals, there exist ζ [ z i 1 , z i ] such that
a i 1 α = 1 z i z i 1 z i 1 z i 1 ( z k η ) α d η = 1 ( z k ζ ) α .
Since z ( t ) is monotonically increasing, it follows that a i > 0 and a k > a k 1 > > a 0 . ☐
Remark 2.
To analyze the truncation error R k , we denote U η = w z 1 η u z 1 η for η [ z i 1 , z i ] , w t k = w k and z t k = z k for convenience. By using the Newton interpolation method, we interpolate U η on [ z i 1 , z i ] as
I U η = w i 1 u i 1 + w i u i w i 1 u i 1 z i z i 1 η z i 1 ,
and according to the theory of Newton interpolation, there exists ϵ [ z i 1 , z i + 1 ] such that
U η I U η = U ϵ 2 ! η z i 1 η z i .
Then, (14) can be rewritten as
R k = w k 1 Γ 1 α i = 1 k z i 1 z i 1 z k η α U η I U η d η = w k 1 Γ 1 α i = 1 k z i 1 z i U ϵ 2 z k η α η z i 1 η z i d η = w k 1 Γ 1 α j = 1 k z i 1 z i U ϵ 2 η z i 1 z i η d z k η α α max t 0 ϵ t k U ϵ max 1 i k z i z i 1 2 8 w k Γ 1 α i = 1 k 1 z i 1 z i z k η α 1 d η + α max t 0 ϵ t k U ϵ 2 w k Γ 1 α z k 1 z k η z k 1 z k η z k η α 1 d ξ
i = 1 k 1 z i 1 z i z k η α 1 d η = 1 α z k z k 1 α [ z k z 0 α 1 α z k z k 1 α
z k 1 z k η z k 1 z k η z k η α 1 d η = 1 1 α z k 1 z k z k η 1 α d η = 1 1 α 2 α z k z k 1 2 α .
Thus,
R k 1 8 w k Γ 1 α + α 2 w k Γ 3 α max t 0 η t k U η max 1 i k z i z i 1 2 α .
Denote [ t i * 1 , t i * ] as the interval satisfying max 1 i k z i z i 1 = z i * z i * 1 , then the truncation error (14) has the form
R k 1 8 w k Γ 1 α + α 2 w k Γ 3 α max t 0 η t k U η L Δ t 2 α
when z ( t ) satisfies the Lipschitz condition on [ t i * 1 , t i * ] and L is the Lipschitz constant.
According to the finite difference approximation (12) and replacing the nonlinear part u x , t k with the former step u x , t k 1 , we have the semi-discretization form of the generalized fractional KdV Equation (10) as
1 η k a k w k u x , t k + ξ u x , t k 1 u ( x , t k ) x + δ 3 u ( x , t k ) x 3 = 1 η k i = 1 k 1 a i + 1 a i w i u x , t i + a 1 w 0 u x , t 0 + R k + f x , t k , k = 1 , , M ,
where η i = w i Γ 2 α .

3.2. Numerical Discretization in the Space Direction

As the homogeneous Neumann condition is included in the boundary conditions, we choose a type of polynomial as p ˜ x = b x p x to approximate to the u x , t in the space direction. In our problem, we set that p x is a combination of Jacobi polynomials of degree N , and p ˜ x satisfies the Equation (10) exactly at x j , j = 1 , , N 1 and boundary condition at x 0 and x N . x j , j = 0 , , N are Jacobi–Gauss–Lobatto (JGL) nodes on [ a , b ] by introducing the change of variable
x j = b a 2 x j γ , β + 1 + a , 0 j N ,
where x j γ , β , j = 0 , , N are JGL points on [−1, 1]. Based on the analysis above, we take
ψ n x = b x J n γ , β x , j = 0 , 1 , , N ,
as the basis functions in the space direction. Then, the numerical solution of problem (10) has the form:
u N x , t = n = 0 N ϕ n t ψ n x ,
satisfying
n = 0 N ϕ n t J n γ , β x 0 = 0 ,
n = 0 N ϕ n t J n γ , β x N = 0 ,
for any t [ 0 , T ] . Substituting (24) to the semi-discretization (22), we have
n = 0 N 1 η k a k w k ϕ n t k ψ n x + ξ u N x , t k 1 ϕ n t k ψ n x + δ ϕ n t k ψ n x = 1 η k n = 0 N i = 1 k 1 a i + 1 a i w i ϕ n t i + a 1 w 0 ϕ n t 0 ψ n x + R k + R s + f k x ,
where f k x = f x , t k and R s is the error in the space direction caused by replacing u x , t with u N x , t . The classical first- and third-order partial derivatives in (27) are derived as
ψ n x = Γ n + 2 + γ + β Γ n + α + β + 1 b a J n 1 γ + 1 , β + 1 x b x J n γ , β x ,
ψ n x = Γ n + 4 + γ + β Γ n + α + β + 1 b a 3 J n 3 γ + 3 , β + 3 x b x 3 Γ n + 3 + γ + β Γ n + α + β + 1 b a 2 J n 2 γ + 2 , β + 2 x .
Neglecting the error parts, we obtain the full discretization scheme of Equation (10). For x j , t k ( a , b ) × ( 0 , T ] , j = 1 , , N 1 ; k = 1 , , M , it holds that
n = 0 N a k 1 η k w k J n γ , β x j b x j + ξ u N x j , t k 1 c 1 J n 1 γ + 1 , β + 1 x j b x j J n γ , β x j + δ c 3 J n 3 γ + 3 , β + 3 x j b x j c 2 J n 2 γ + 2 , β + 2 x j ϕ n t k = n = 0 N 1 η k + 1 i = 1 k 1 a i + 1 a i w i ϕ n t i + a 1 w 0 ϕ n t 0 J n γ , β x j b x j + f k x j ,
where
c p = Γ n + p + 1 + γ + β Γ n + α + β + 1 b a p , p = 1 , 2 , 3 .

3.3. Stability Analysis

Firstly, we consider the linear case of the generalized fractional KdV equation as
* D a + α u ( x , t ) + ξ u ( x , t ) x + δ 3 u ( x , t ) x 3 = f x , t , ( x , t ) ( a , b ) × ( 0 , T ] ,
and similarly, we discretize the linear case as
n = 0 N a k 1 η k w k J n γ , β x j b x j + ξ c 1 J n 1 γ + 1 , β + 1 x j b x j J n γ , β x j + δ c 3 J n 3 γ + 3 , β + 3 x j b x j c 2 J n 2 γ + 2 , β + 2 x j ϕ n t k = n = 0 N 1 η k + 1 i = 1 k 1 a i + 1 a i w i ϕ n t i + a 1 w 0 ϕ n t 0 J n γ , β x j b x j + f k x j .
Now we state our main theorem as follows.
Theorem 1.
Assume that u x , t is a continuous function satisfying boundary conditions (11) for any t, and f x , t is continuous function. Letting u N k x = n = 0 N ϕ n t k ψ n x is the numerical solution of discrete scheme (33), the scheme (33) is stable unconditionally and for any k 0 , it holds that
u N k x L 2 w 0 w k u N 0 x L 2 + i = 1 k 1 h i w k f i L 2 + η k a k w k f k L 2 ,
where h i = 1 a i 1 a i + 1 η i , i = 1 , , k 1 .
Proof. 
Let w ^ β , γ x = 2 b a β + γ b x β x a γ , and v N 2 k x = v N 2 x , t k is a polynomial of degree N 2 satisfying u N k x = v N 2 k x w ^ β , γ x . The discrete form (30) at JGL nodes x j can be rewritten as
a k η k w k u N k x j + ξ x u N + 1 k x j + δ x x x u N k x j = i = 1 k 1 a i + 1 a i η k + 1 w i u N i x j + a 1 η k w 0 u N 0 x j + f k x j .
Multiplying both sides of (35) by v N 2 k x j w ^ j and summing for j from 0 to N leads to
j = 0 N a k η k w k u N k x j + ξ x u N k x j + δ x x x u N k x j v N 2 k x j w ^ j = j = 0 N i = 1 k 1 a i + 1 a i η k w i u N i x j + a 1 η k w 0 u N 0 x j + f k x j v N 2 k x j w ^ j ,
where w ^ j is the corresponding weight. Since the degrees of u N k x , x u N k x and x x x u N k x are not exceeding N + 1 , according to (8), they can be exactly expressed by the Jacobi–Gauss–Lobatto quadrature:
j = 0 N u N k x j v N 2 k x j w ^ j = u N k , v N 2 k w ˜ β , γ x = u N k , u N k ,
j = 0 N x u N k x j v N 2 k x j w ^ j = x u N k , v N 2 k w ˜ β , γ x = x u N k , u N k ,
j = 0 N x x x u N k x j v N 2 k x j w ^ j = x x x u N k , v N 2 k w ˜ β , γ x = x x x u N k , u N k .
It is straightforward to show that
a b x u N k x u N k x d x = 1 2 u N k x 2 | a b = 0 ,
and
a b x x x u N k x u N k x d x = x x u N k x u N k x | a b a b x x u N k x x u N k x d x = x u N k x 2 | a b > 0 ,
which yields
a k w k u N k x L 2 i = 1 k 1 a i + 1 a i w i u N i x L 2 + a 1 w 0 u N 0 x L 2 + η k f k x L 2 ,
by applying Cauchy–Schwartz inequality and Lemma 1.
In the following, we will continue our proof by induction. Obviously, (34) holds when k = 0 according to (42):
w 1 u N 1 x L 2 w 0 u N 0 x L 2 + η 1 a 1 f 1 x L 2 .
Assuming that (34) is valid for any i = 0 , 1 , , k 1 , it is easy to verify from (42) that
w k u N k x L 2 i = 1 k 1 a i + 1 a i a k w i u N i x L 2 + a 1 a k w 0 u N 0 x L 2 + η k a k f k x L 2 , a k a k 1 a k w 0 u N 0 x L 2 + i = 1 k 2 1 a i 1 a i + 1 η i f i L 2 + η k 1 f k 1 L 2 a k 1 + a k 1 a k 2 a k w 0 u N 0 x L 2 + i = 1 k 3 1 a i 1 a i + 1 η i f i L 2 + η k 2 f k 2 L 2 a k 2 + + + a 3 a 2 a k w 0 u N 0 x L 2 + i = 1 1 1 a i 1 a i + 1 η i f i L 2 + η 2 f 2 L 2 a 2 + a 2 a 1 a k w 0 u N 0 x L 2 + η 1 f 1 L 2 a 1 + a 1 a k w 0 u N 0 x L 2 + η k a k f k x L 2 w 0 u N 0 x L 2 + i = 1 k 1 1 a i 1 a i + 1 η i f i L 2 + η k a k f k L 2 .
This completes the proof. ☐
Remark 3.
For the nonlinear case (10), at every collocation node x j , we have the ’frozen coefficient’ ξ u x j . Since Theorem 1 is sustained for any constant ξ, the discretization scheme (30) is stable by regarding ξ u N k 1 x j as a constant coefficient.

4. Numerical Results and Analysis

In Section 3.3, we proved the stability of the proposed scheme in the linear case. Following numerical examples will show that our algorithm is also available in the nonlinear case. In this part, two numerical examples are provided to demonstrate the effectiveness of the finite difference/collocation scheme. The initial and boundary conditions are given to establish an exact solution in the first example to analyze error and convergence numerically. In the second example, the initial condition is taken as a hyperbolic sine function and the boundary condition is homogenous. For convenience, we take the weight function w t = 1 in the following part.
Example 1.
Consider the generalized fractional KdV Equation (10) with following initial and boundary conditions
u ( x , 0 ) = x 1 x 2 , x [ 0 , 1 ] , u 0 , t = u 1 , t = 0 , t [ 0 , 1 ] , u x 1 , t = 0 , t [ 0 , 1 ] .
With the above conditions, by taking
f x , t = g ( t ) x 1 x 2 + ξ 1 t 6 2 3 x 5 10 x 4 + 12 x 3 6 x 2 + x + 6 δ 1 t 6 ,
the problem (10) has the exact solution of form
u x , t = 1 t 6 x 1 x 2 .
Here, we choose ξ = 6 , δ = 1 , γ = β = 1 and g ( t ) = Γ ( 7 ) Γ ( 7 α ) t 6 α for z ( t ) = t , g ( t ) = Γ ( 13 ) Γ ( 13 α ) t 6 α / 2 for z ( t ) = t , and g ( t ) = 6 Γ ( 4 α ) t 6 2 α for z ( t ) = t 2 , respectively. When z t = t , the generalized fractional derivative in (10) is the classical Caputo fractional derivative.
Figure 1 shows the numerical solutions and the distribution of absolute error when α = 0 . 8 , N = 20 and M = 50 . Note that numerical solutions are highly aligned with exact solutions.
With the computer of 1.8 GHz Intel Core i5 and 8 GB 1600 MHz DDR3, Table 1, Table 2 and Table 3 list maximal absolute errors (MAE), convergence order (CO) and elapsed time with three different scale functions: z t = t , z t = t and z t = t 2 . Results show that the convergence order under different scale functions increases as the fractional derivative order decreases, and is close to 2 α .
Example 2.
Consider the generalized fractional KdV Equation (10) with following initial and boundary conditions
u ( x , 0 ) = 1 2 s e c h 2 1 2 x , x [ 10 , 10 ] u ( 10 , t ) = u ( 10 , t ) = 0 , t [ 0 , T ] , u x 10 , t = 0 , t [ 0 , T ] .
Here, we set f x , t = 0 . When α = 1 , this problem has a soliton solution in the form of u x , t = 0 . 5 sech 2 0 . 5 x t in case ξ = 6 and δ = 1 (see [5]).
Applying the proposed finite difference/collocation scheme, we obtain the numerical solutions over the domain under different situations. Firstly, letting z t = t , the generalized fractional derivative in (10) is equivalent to the Caputo fractional derivative. Figure 2 shows the influence of δ and α under conditions of T = 2 , ξ = 6 . By fixing α = 0 . 8 , diffusion processes with δ = 0 . 2 and δ = 1 are illustrated. It is shown that when δ is small, the soliton (initial condition) will be decomposed to neighboring solitons, whose amplitudes are affected by the fractional derivative α . This decomposing phenomenon cannot be observed when δ becomes larger. In the case of δ = 1 , the soliton wave does not move much with 0 < t < 2 as expected, and with the decreasing of α , the amplitudes are getting smaller.
Next, numerical results with different scale functions z t = t 0 . 5 , t , t 2 and t 5 are shown in Figure 3 when T = 1 . Denoting z t = t s , 0 t 1 , scale function z t behaves like a “contracting function” for the time variable over domain [ 0 , 1 ] when s > 1 , while behaving like a “stretching function” as s < 1 (see [25]). From Figure 3, when s = 0 . 5 , decomposing and diffusion phenomena appeared earlier in contrast with the case when s = 1 , just like being contracted. On the contrary, the decomposing process works quite slowly when s > 1 . Moreover, the speed of decomposing is slower as s becomes larger. However, comparing with Figure 2a, Figure 3e,f shows that when t > 1 , with the increasing of s, the speed of decomposing is getting faster.

5. Conclusions

We numerically study a new class of KdV equation, in which the partial derivative on the time variable is defined by a new generalized fractional derivative. The finite difference method is applied to solve the generalized fractional KdV equation under different selections of parameter, order of fractional derivatives and initial conditions. The stability of the numerical scheme is verified and the order of convergence is evaluated numerically in cases of different scale functions. Numerical examples are provided to demonstrate the effectiveness and accuracy of the numerical scheme. Furthermore, we investigate the dynamics of soliton solution in the generalized fractional KdV equation via simulation. We find that the number and amplitude of waves are significantly influenced by the parameter in the equation and the order of fractional derivatives.

Acknowledgments

This work was partly supported by the National Key Research an Development Program of China (No. 2017YFB0701700), the NSFC (No. 11501581, No. 51134003, No. 51174236), the Research Project (No. 502042032) of Central South University, the Project funded by China Postdoctoral Science Foundation (No. 2015M570683), the Project supported by the National Basic Research Development Program of China (No. 2011CB606306), the project supported by the National Key Laboratory Open Program of Porous metal material of China (No. PMM-SKL-4-2012).

Author Contributions

Wen Cao conceived and designed the experiments; Wen Cao and Yufeng Xu analyzed the data; Zhoushun Zheng contributed analysis tools; Wen Cao, Yufeng Xu and Zhoushun Zheng wrote the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Korteweg, D.J.; de Vries, G. On the change of form of long waves and advancing in a rectangular canal and on a new type of long stationary waves. Philos. Mag. 1895, 39, 422–443. [Google Scholar] [CrossRef]
  2. Tian, B.; Gao, Y.-T. Exact solutions for the Bogoyavlenskii coupled KdV equations. Phys. Lett. A 1995, 208, 193–196. [Google Scholar] [CrossRef]
  3. Vlieg-Hulstman, M.; Halford, W.D. Exact solutions to KdV equations with variable coefficients and/or nonuniformities. Comput. Math. Appl. 1995, 29, 39–47. [Google Scholar] [CrossRef]
  4. Senthilkumaran, M.; Pandiaraja, D.; Vaganan, B.M. New exact explicit solutions of the generalized KdV equations. Appl. Math. Comput. 2008, 202, 693–699. [Google Scholar] [CrossRef]
  5. Akdi, M.; Sedra, M.B. Numerical KdV equation by the adomian decomposition method. Am. J. Mod. Phys. 2013, 2, 111–115. [Google Scholar] [CrossRef]
  6. Ma, H.; Sun, W. A Legendre-Petrov-Galerkin and Chebyshev collocation method for third-order differential equations. SIAM J. Numer. Anal. 2000, 38, 1425–1438. [Google Scholar] [CrossRef]
  7. Shen, J. A new Dual-Petrov-Galerkin method for third and high odd-order differential equations: Application to the KdV equation. SIAM J. Numer. Anal. 2003, 41, 1595–1619. [Google Scholar] [CrossRef]
  8. Guo, J.; Taha, T.R. Parallel implementation of the split-step and the pseudospectral methods for solving higher KdV equation. Math. Comput. Simul. 2003, 62, 41–51. [Google Scholar] [CrossRef]
  9. An, H.; Chen, Y. Numerical complexiton solutions for the complex KdV equation by the homotopy perturbation method. Appl. Math. Comput. 2008, 203, 125–133. [Google Scholar] [CrossRef]
  10. Dag, I.; Dereli, Y. Numerical solutions of KdV equation using radial basis functions. Appl. Math. Model. 2008, 32, 535–546. [Google Scholar] [CrossRef]
  11. Bhatta, D. Use of modified Bernstein polynomials to solve KdV-Burgers equation numerically. Appl. Math. Comput. 2008, 206, 457–464. [Google Scholar] [CrossRef]
  12. Al-Khaled, K.; Haynes, N.; Schiesser, W.; Usman, M. Eventual periodicity of the forced oscillations for a Korteweg-de Vries type equation on a bounded domain using a sinc collocation method. J. Comput. Appl. Math. 2018, 330, 417–428. [Google Scholar] [CrossRef]
  13. Xu, Y.; He, Z. The short memory principle for solving Abel differential equation of fractional order. Comput. Math. Appl. 2011, 62, 4796–4805. [Google Scholar] [CrossRef]
  14. Xu, Q.; Hesthaven, J.S. Stable multi-domain spectral penalty methods for fractional partial differential equations. J. Comput. Phys. 2014, 257, 241–258. [Google Scholar] [CrossRef]
  15. Zhao, X.; Xu, Q. Efficient numerical schemes for fractional sub-diffusion equation with the spatially variable coefficient. Appl. Math. Model. 2014, 38, 3848–3859. [Google Scholar] [CrossRef]
  16. Xu, Q.; Hesthaven, J.S. Discontinuous Galerkin method for fractional convection-diffusion equations. SIAM J. Numer. Anal. 2014, 52, 405–423. [Google Scholar] [CrossRef]
  17. Momani, S. An explicit and numerical solutions of the fractional KdV equation. Math. Comput. Simul. 2005, 70, 110–118. [Google Scholar] [CrossRef]
  18. Wang, Q. Numerical solutions for fractional KdV-Burgers equation by Adomian decomposition method. Appl. Math. Comput. 2006, 182, 1048–1055. [Google Scholar]
  19. Song, L.; Zhang, H. Application of homotopy analysis method to fractional KdV-Burgers-Kuramoto equation. Phys. Lett. A 2007, 367, 88–94. [Google Scholar] [CrossRef]
  20. Odibat, Z.M. Exact solitary solutions for variants of the KdV equations with fractional time derivatives. Chaos Soliton Fractal 2009, 40, 1264–1270. [Google Scholar] [CrossRef]
  21. El-Ajou, A.; Arqub, O.A.; Momani, S. Approximate analytical solution of the nonlinear fractional KdV-Burgers equation: A new iterative algorithm. J. Comput. Phys. 2015, 293, 81–95. [Google Scholar] [CrossRef]
  22. Doungmo Goufo, E.F. Application of the Caputo-Fabrizio fractional derivative without singular kernel to Korteweg-de Vries-Burgers Equation. Math. Model. Anal. 2016, 21, 188–198. [Google Scholar] [CrossRef]
  23. Guo, S.; Mei, L.; He, Y.; Li, Y. Time-fractional Schamel–KdV equation for dust-ion-acoustic waves in pair-ion plasma with trapped electrons and opposite polarity dust grains. Phys. Lett. A 2016, 380, 1031–1036. [Google Scholar] [CrossRef]
  24. Agrawal, O.P. Some generalized fractional calculus operators and theeir applications in integral equations. Fract. Calc. Appl. Anal. 2012, 15, 700–711. [Google Scholar] [CrossRef]
  25. Xu, Y.; Agrawal, O.P. Numerical solutions and analysis of diffusion for new generalized fractional Burgers equation. Fract. Calc. Appl. Anal. 2013, 16, 709–736. [Google Scholar] [CrossRef]
  26. Xu, Y.; He, Z.; Agrawal, O.P. Numerical and analytical solutions of new generalized fractional diffusion equation. Comput. Math. Appl. 2013, 66, 2019–2029. [Google Scholar] [CrossRef]
  27. Xu, Y.; Agrawal, O.P. Numerical solutions and analysis of diffusion for new generalized fractional advection-diffusion equations. Cent. Eur. J. Phys. 2013, 11, 1178–1193. [Google Scholar] [CrossRef]
  28. Xu, Y.; Agrawal, O.P. Models and numerical solutions of generalized oscillator equations. J. Vib. Acoust. 2014, 136, 50903. [Google Scholar] [CrossRef]
  29. Cao, W.; Xu, Y.; Zheng, Z. Existence results for a class of generalized fractional boundary value problem. Adv. Differ. Equ. 2017, in press. [Google Scholar] [CrossRef]
  30. Shen, J.; Tang, T.; Wang, L.-L. Spectral Methods; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
Figure 1. Numerical solutions and error distribution of Example 1. (a) Numerical solutions; (b) distribution of absolute error.
Figure 1. Numerical solutions and error distribution of Example 1. (a) Numerical solutions; (b) distribution of absolute error.
Applsci 08 00042 g001
Figure 2. The effect of δ and α of Example 2 when z ( t ) = t . (a) δ = 0 . 2 , α = 0 . 8 ; (b) δ = 1 , α = 0 . 8 ; (c) δ = 0 . 2 ; (d) δ = 1 .
Figure 2. The effect of δ and α of Example 2 when z ( t ) = t . (a) δ = 0 . 2 , α = 0 . 8 ; (b) δ = 1 , α = 0 . 8 ; (c) δ = 0 . 2 ; (d) δ = 1 .
Applsci 08 00042 g002
Figure 3. The influence of z ( t ) of Example 2 with α = 0 . 8 and δ = 0 . 2 . (a) z t = t ; (b) z t = t 2 ; (c) z t = t 0 . 5 ; (d) z t = t 5 ; (e) z t = t 0 . 5 ; (f) z t = t 2 .
Figure 3. The influence of z ( t ) of Example 2 with α = 0 . 8 and δ = 0 . 2 . (a) z t = t ; (b) z t = t 2 ; (c) z t = t 0 . 5 ; (d) z t = t 5 ; (e) z t = t 0 . 5 ; (f) z t = t 2 .
Applsci 08 00042 g003
Table 1. The maximal absolute error (MAE) and convergence order (CO) for Example 1 when z ( t ) = t .
Table 1. The maximal absolute error (MAE) and convergence order (CO) for Example 1 when z ( t ) = t .
M α = 0.2 α = 0.6 α = 0.9
MAECOTimeMAECOTimeMAECOTime
1001.39 × 10 6 -7.9 s2.67 × 10 5 -7.1 s1.71 × 10 4 -7.4 s
2004.28 × 10 7 1.7018.7 s1.03 × 10 5 1.3717.6 s8.04 × 10 5 1.0917.9 s
3002.13 × 10 7 1.7232.1 s5.89 × 10 6 1.3830.3 s5.16 × 10 5 1.0931.7 s
4001.29 × 10 7 1.7346.3 s3.95 × 10 6 1.3847.6 s3.76 × 10 5 1.1047.2 s
Table 2. The maximal error and convergence order for Example 1 when z ( t ) = t .
Table 2. The maximal error and convergence order for Example 1 when z ( t ) = t .
M α = 0.2 α = 0.6 α = 0.9
MAECOTimeMAECOTimeMAECOTime
1001.77 × 10 6 -7.9 s4.38 × 10 5 -7.6 s3.35 × 10 4 -7.5 s
2005.42 × 10 7 1.7017.8 s1.69 × 10 5 1.3718.2 s1.58 × 10 4 1.0917.3 s
3002.70 × 10 7 1.7233.4 s9.66 × 10 6 1.3830.9 s1.01 × 10 4 1.0930.6 s
4001.64 × 10 7 1.7352.16 s6.48 × 10 6 1.3955.4 s7.38 × 10 5 1.0951.8 s
Table 3. The maximal error and convergence order for Example 1 when z ( t ) = t 2 .
Table 3. The maximal error and convergence order for Example 1 when z ( t ) = t 2 .
M α = 0.2 α = 0.6 α = 0.9
MAECOTimeMAECOTimeMAECOTime
1009.64 × 10 7 -7.5 s1.43 × 10 5 -7.5 s7.52 × 10 5 -7.3 s
2002.96 × 10 7 1.7018.2 s5.50 × 10 6 1.3716.9 s3.54 × 10 5 1.0917.6 s
3001.48 × 10 7 1.7231.8 s3.14 × 10 6 1.3829.8 s2.27 × 10 5 1.0929.7 s
4008.99 × 10 8 1.7246.1 s2.11 × 10 6 1.3948.2 s1.66 × 10 5 1.1049.1 s

Share and Cite

MDPI and ACS Style

Cao, W.; Xu, Y.; Zheng, Z. Finite Difference/Collocation Method for a Generalized Time-Fractional KdV Equation. Appl. Sci. 2018, 8, 42. https://doi.org/10.3390/app8010042

AMA Style

Cao W, Xu Y, Zheng Z. Finite Difference/Collocation Method for a Generalized Time-Fractional KdV Equation. Applied Sciences. 2018; 8(1):42. https://doi.org/10.3390/app8010042

Chicago/Turabian Style

Cao, Wen, Yufeng Xu, and Zhoushun Zheng. 2018. "Finite Difference/Collocation Method for a Generalized Time-Fractional KdV Equation" Applied Sciences 8, no. 1: 42. https://doi.org/10.3390/app8010042

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop