This work is licensed under the Creative Commons Attribution 4.0 International License.
Introduction
Fractional analysis; is the generalization of the classic analysis of integration and differentiation of process (noninteger) order. This issue is an old issue as much as differential calculus. G. W. Leibniz and Marquis de L' Hospital correspondence in 1695, is known as the first exit point of fractional calculus. Leibniz expressed fractional order derivatives of noninteger order f (x) = emx, m ∈ R, as follows:
Later, many scientists, such as Liouville, Riemann,Weyl, Lacroix, Leibniz, Grunward and Letnikov (cf. [4]), expanded the range of this derivative.
Since the beginning of the definition of fractional order derivatives first handled by Leibniz, fractional partial differential equations have attracted the attention of many scientists and have also shown a progressive development.(cf. [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 17, 18, 19]).
Beside these facts, the third order fractional Harry Dym partial differential equation is studied in mathematics and especially in the theory of solitons. This equation is given as
Here, 0 < γ ≤ 1 is the order of fractional derivative and u(x, t) is a function of x and t.
The Harry Dym equation first appeared in a study by Kruskal [10]. Harry Dym equation represents a system in which dispersion and nonlinearity were coupled. Furthermore, the Harry Dym equation is a completely integrable nonlinear evolution that may be solved by means of the inverse scattering transform. It does not possess the Painlevé property.
This paper is organized as follows:
In the second section, some basic facts dealing with the finite difference method are mentioned and three Linearization techniques are presented. In the third section, stability analysis of the proposed method is investigated and it is shown that the Harry Dym equation is stable under which conditions. Also, numerical examples are given. In the fourth section, conclusions obtained throughout the paper are discussed.
Finite Difference Methods
In this section, we first need to define a set of grid points in a domain D to obtain a numerical solution to Eq. (1:1) using finite difference methods as follows:
Let $\Delta x\left( h \right)=\frac{b-a}{N}$(N is an integer) denotes a state step size and Δt denotes a time step size. Draw a set of horizontal and vertical line across D, and get all intersection points (xj, tn) or simply ( j,n) where x j = a+ jΔx, j = 0,1,2, · · · ,N, and tn = nΔt, n = 0,1, . . . ,M. If we write D = [a,b]×[0,T] then we may choose $\Delta t=\frac{T}{M}\left( M \right.$is an integer) and tn = nΔt, n = 0,1, . . . ,M.
Then, an appropriate finite difference approximation is given in Eq. (1.1) instead of derivatives and its variable. In this case, the solution problem of Eq. (1.1) is reduced to solution problem of algebraic differential systems of linear and nonlinear equations consisting of finite difference equation. But when applied to non-linear problems, it normally leads to nonlinear system of equations and they cannot be solved directly. Therefore, we use three linearization techniques for a nonlinear term as given in Eq. (1.1).
Linearization 1
First, we use the Caputo fractional derivative approximation for $\frac{{{\partial }^{\gamma }}u}{\partial {{t}^{\gamma }}}$defined by
and Crank–Nicolson derivative approximation given by
$$u=\frac{{{u}^{n+1}}+{{u}^{n}}}{2},$$
in Eq. (1.1) at the nodal point (m,n+1) [12]. Then, if we discretize time derivative of the fractional Harry Dym equation by using Caputo fractional derivative formula between two successive time levels n and n +1, Crank Nicolson derivative formula and usual finite difference formula between two successive time levels n and n +1,respectively, we obtain
Let us use the Caputo fractional derivative approximation for $\frac{{{\partial }^{\gamma }}u}{\partial {{t}^{\gamma }}}.,$Crank–Nicolson derivative approximation and usual finite difference approximation for Uxxx given by
Eq. (2.3) can be solved using an approximate algorithm.
Linearization 3
Let us use the Caputo fractional derivative approximation for $\frac{{{\partial }^{\gamma }}u}{\partial {{t}^{\gamma }}}$and usual finite difference approximation for Uxxx in Eq. (1.1) at the nodal point (m,n+1) respectively [12]: If we use the following linearization technique for the nonlinear term U3Uxxx, then we have
Eq. (2.4) can be solved using an approximate algorithm.
Stability analysis
In this section, we investigate whether this method is stable based on von-Neumann analysis. If the Fourier method analyzes the stability, then the growth factor of a typical Fourier mode is defined as:
where ξ n is considered as the amplification factor. First, by substituting the Fourier mode (3.1) into the recurrence relationship (2.3), one can obtain
For the Fourier stability definition and for the examined scheme to be stable, the condition |ξ | ≤ 1 must be gratified. Therefore, if the following inequality is provided, the schema is unconditionally stable.
$$\frac{X_{1}^{2}}{Y_{1}^{2}+Y_{2}^{2}}\le 1.$$
Other schemes can be studied by following a similar way.
L2 and L∞ error norms
The equation of the numerical results was obtained for the test problem used in this study and all computations have been run on using double precision arithmetic. To show how accurate the results, both the error norm L2
In our computations, for the numerical solution of the test problem three different linearization techniques have been applied. The values of the error norms L2 and L∞ have been computed at t = 1 for different values of Δt, h. The comparison of the error norms L2 and L∞ obtained by the linearization techniques is summarized in Table 1. As summarized in Table 1, it is obvious that the obtained results using linearization 1 are better than the obtained results using other linearizations. As shown in Figure 1, one can compare the exact and approximate solution of the collocation method using four radial basis functions for h = 0.01. Similarly, as shown in Figures 2 and 3 the exact and approximate solutions can be compared for linearization 2 and linearization 3 successively.
Comparison of the error norms L2 and L∞ that are obtained using the linearization techniques at t= 1,α= 0.9 for different values of Δt, h.
Lin. I
Lin. II
Lin. III
L2×102
L∞×102
L2×102
L∞×102
L2×102
L∞×102
Δt = h = 0.001
0.00002
0.00002
0.00566
0.05664
0.00565
0.05659
Δt = h = 0.05
0.05254
0.08344
0.64556
0.94172
0.58516
0.84499
Δt = h = 0.04
0.02957
0.05128
0.50690
0.82106
0.47224
0.76100
Δt = h = 0.03
0.01418
0.02773
0.36800
0.68391
0.35113
0.65086
Δt = h = 0.02
0.00506
0.01186
0.23124
0.52313
0.22502
0.50855
Δt = h = 0.01
0.00088
0.00285
0.10161
0.32318
0.10046
0.31945
Δt = h = 0.2
2.44568
0.00285
3.12756
3.78842
0.80756
1.29370
Δt = h = 0.1
3.27620
0.41645
1.31211
1.41287
0.94027
0.94563
Conclusions
Finite difference methods based on using three different linearization techniques have been proposed for the numerical solutions of the fractional Harry Dym equation. In addition, numerical results were obtained by using three different linearization techniques. The proposed method has been tested on a problem and demonstrated how effective it is. The error norms L2 and L∞ have been calculated and given. The third linearization technique, as shown in Figure 3, yielded better results. Because the third linearization technique gives better results, this technique can be suggested in the next problems and the situation of the problem should be considered. The obtained results show that the error norms are sufficiently small during all computer runs. It has been observed that the considered method is a power numerical scheme to solve the fractional Harry Dym equation.