Reproducing kernel Hilbert space method for the solutions of generalized Kuramoto–Sivashinsky equation

Reproducing kernel Hilbert space method is given for the solution of generalized Kuramoto–Sivashinsky equation. Reproducing kernel functions are obtained to get the solution of the generalized Kuramoto–Sivashinsky equation. Two examples have been introduced to prove the accuracy of the method. The obtained results show that the reproducing kernel Hilbert space method gives approximate analytical solutions which are very close to the exact solution of the generalized Kuramoto–Sivashinsky equation, which demonstrates the power of the proposed technique. We prove the efficiency of the reproducing kernel Hilbert space method in this paper.


Introduction
The generalized Kuramoto-Sivashinsky equation is a model of nonlinear partial differential equation which encountered in the work of continuous media [1]. We investigate this equation by reproducing kernel Hilbert space method: where α, β and γ are non-zero [2,3]. Equation (1) is called the Kuramoto-Sivashinsky equation for β = 0. This equation emerges in the context of long waves on the interface between two viscous fluids [4], unstable drift waves in plasmas, and flame front instability [5]. This equation is practical to model solitary pulses in a falling thin film [6].
Many techniques have been given to investigate this equation recently. This equation is investigated by lattice Boltzmann technique in [9]. The method of radial basis functions [10,11] has been enhanced in [12] to obtain the approximate solution of this equation. The local discontinuous Galerkin methods have been used to search this equation in [13]. The tanh function method has been proposed in [14].
Reproducing kernel Hilbert space method is very powerful method. There are many advantages of this method. We can obtain approximate solutions of the problems in a short time by this method. The approximate solutions to the equations have been computed by using the RKHSM without any need to transformation techniques and linearization or perturbation of the equations. The RKHSM avoids the difficulties and massive computational work by determining the analytic solutions.
Reproducing kernels were used for the first time at the beginning of the twentieth century [15,16]. Geng [17] have applied a new reproducing kernel Hilbert space method for solving nonlinear fourthorder boundary value problems. Zhang et al. [18] have found reproducing kernel functions represented by form of polynomials. Gumah et al. [19] have investigated the solutions of uncertain Volterra integral equations by fitted reproducing kernel Hilbert space method. Saadeh et al. [20] have studied the numerical investigation for solving two-point fuzzy boundary value problems by reproducing kernel approach. Arqub et al. [21] have found numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Hashemi et al. [22] have solved the Lane-Emden equation within a reproducing kernel method and group preserving scheme. Arqub et al. [23] have found the numerical solutions of fractional differential equations of Lane-Emden type by an accurate technique. For more details see [24][25][26][27][28].
We organize our paper as: In Section 2 some useful reproducing kernel functions are obtained. In Section 3 reproducing kernel Hilbert space method is applied to find the solution of the generalized Kuramoto-Sivashinsky equation. Numerical results have been shown in Section 4. Conclusion is given in the final section.

Some useful reproducing kernel functions
We need the following reproducing kernel Hilbert spaces to obtain the solution of Equation (1). We find very useful reproducing kernel functions in these spaces.
is a reproducing kernel Hilbert space. We define this space as: where AC defines the absolutely continuous functions.
We have the inner product and norm for this space as: We find the reproducing kernel function m t of this space as ( [29], pp. 10 and 17): Definition 2.2: V 2 2 [0, 1] is a reproducing kernel Hilbert space. We define this space as: We construct the inner product and norm in this space as: and We find the reproducing kernel function n x of this space as [29]: is also a reproducing kernel Hilbert space. We need this special space for domain.
We define this space as: We describe the inner product and the norm of this space by: and We find the reproducing kernel function N x of this reproducing kernel Hilbert space as [29]: is a reproducing kernel Hilbert space. We need this space also for domain. We define this special Hilbert space by: (4) are absolutely continuous functions in We present the inner product and norm for this space as: and Then, we obtain (4) (1)M (5) t (1) − η (4) (0)M (5) t (0) − η (3) (1)M (6) t (1) If we have t (1) = 0, then, we will get Therefore, we can write We know that when θ = t, we have Thus, we reach The unknown conditions can be obtained by the above equations easily. This completes the proof.

Definition 2.6:
We need the binary reproducing kernel Hilbert spaces to solve the partial differential equations by reproducing kernel Hilbert space method. Our first binary reproducing kernel Hilbert space 1], is given as [29]: where CC defines the space of completely continuous functions.
We have the inner product and the norm for this space as [29]: and

Lemma 2.7: V(D) is a binary reproducing kernel Hilbert space and A (t,x)
is the reproducing kernel function of this space. We find A (t,x) by [29]:

Definition 2.8:
The second binary reproducing kernel Hilbert space that we need is V(D). We define this space as: We define the inner product and norm of this space as [29]: and

Lemma 2.9:
We find the reproducing kernel function B (t,x) of this binary reproducing kernel Hilbert space as [29]:

Application of the reproducing kernel Hilbert space method
We find the solution of Equation (1) in the reproducing kernel Hilbert space V(D). We describe the bounded linear operator by Then, our problem can be written by: We take a countable dense subset {(t 1 , x 1 ), (t 2 , x 2 ), . . .} in D and present where T * means the adjoint operator of T. The orthonor- can be found by the operation of Gram-Schmidt orthogonalization of {b i } ∞ i=1 as: is dense in D, then the solution of Equation (18) can be found by the proposed technique as: Proof: Then, we acquire by using the feature of the adjoint operator T * . We obtain by implementing the reproducing property. Therefore, the desire result is found as: This completes the proof. The approximate solution s n can be found by:

Numerical experiments
We have investigated the following examples by reproducing kernel Hilbert space method in this section. All the computations were applied by Maple 18. Since, the RKHSM does not need discretization of the variables, that is, time and space, it is also not effected by calculation round-off errors and no need to face with necessity of large computer memory and time. The accuracy of the RKHSM for the problem is controllable. Many scientific properties of the RKHSM can be seen in [30][31][32][33][34][35][36][37][38][39][40].

Example 4.1:
We consider the following problem for our first experiment [41].
with initial condition The exact solution of the problem is found as: We demonstrated our results for this problem in Tables 1-3 .

Example 4.2:
We take into consideration our problem for α = γ = 2, and β = 4. The exact solution of this problem is obtained as [3]: We utilize this exact solution and put t = 0 for initial condition. We obtain the boundary conditions from the exact solution. We demonstrate our results in Figures 1 and 2 .

Conclusions
In this work, we applied the reproducing kernel Hilbert space method to the generalized Kuramoto-Sivashinsky equation. We tested the power of the method on two numerical experiments. We demonstrated our results via tables. We used very important reproducing kernel functions to get the desired results. We concluded that the proposed technique can be applied to more complicated problems.  Table 3. Absolute errors in Example 4.1 by reproducing kernel Hilbert space method (RKHSM), homotopy perturbation method (HPM) and variational iteration method (VIM) for t = 0.0008.

Disclosure statement
No potential conflict of interest was reported by the authors.