- Research
- Open access
- Published:
A new approach for one-dimensional sine-Gordon equation
Advances in Difference Equations volume 2016, Article number: 8 (2016)
Abstract
In this work, we use a reproducing kernel method for investigating the sine-Gordon equation with initial and boundary conditions. Numerical experiments are studied to show the efficiency of the technique. The acquired results are compared with the exact solutions and results obtained by different methods. These results indicate that the reproducing kernel method is very effective.
1 Introduction
The nonlinear one-dimensional sine-Gordon (SG) equation came into sight in the differential geometry and attracted a lot of attention because of the collisional behaviors of solitons that arise from this equation. Numerical solutions of the SG equation have been widely investigated in recent years [1–5]. Compact finite difference and diagonally implicit Runge-Kutta-Nyström (DIRKN) methods were used [3]. The authors of [6] introduced a numerical method for solving the SG equation by using collocation and radial basis functions. The boundary integral equation technique is presented in [7]. Bratsos [8, 9] has researhed a numerical technique for solving the one-dimensional SG equation and a third-order numerical technique for the two-dimensional SG equation. A numerical technique using radial basis functions for the solution of the two-dimensional SG equation has been shown in [10]. Some authors advised spectral techniques and Fourier pseudospectral technique for solving nonlinear wave equation taking a discrete Fourier series and Chebyshev orthogonal polynomials [11–13]. Ma and Wu [14] used a meshless technique by using a multiquadric (MQ) quasi-interpolation. In this paper, we investigate the one-dimensional nonlinear sine-Gordon equation
with initial conditions
and boundary conditions
by using the reproducing kernel method (RKM). We can get numerical results in very short time. By this method nonlinear problems can be solved easily like linear problems. Reproducing kernel functions are very important for numerical results. We can change the inner product in the spaces and obtain different reproducing kernel functions for better results. These are advantages of this method. Homogenizing the initial and boundary conditions is very significant for this method. We give a general transformation to homogenize the initial and boundary conditions in Section 3.
The theory of reproducing kernels [15] was used for the first time at the beginning of the 20th century by Zaremba. Reproducing kernel theory has important implementations in numerical analysis, differential equations, and probability and statistics [16–25]. The efficiency of the method was used by many authors to research several scientific implementations. The reproducing kernel functions can be represented by piecewise polynomials, and the higher the order of derivatives, the simpler the reproducing kernel function statements. Such statements of reproducing kernel functions are the simplest from the computational viewpoint, and the speed and accuracy can be significantly improved in scientific and engineering implementations. The productivity of such reproducing kernel functions is indicated to be very exhorting by experimental results [26].
This work is arranged as follows. Section 2 introduces several useful reproducing kernel functions. A representation of solution in\(W_{2}^{(3,3)} ( \Omega ) \) is given in Section 3. Section 4 presents the essential results: exact and approximate solutions of (1)-(3); enhancement of the method to some problems in the reproducing kernel space; and convergence of the approximate solution. Some numerical examples are discussed in Section 5. There are some conclusions in the final section.
2 Reproducing kernel functions
We obtain some useful reproducing kernel functions in this section.
Definition 1
[16]
Let E be a nonempty set. A function \(K:E\times E\longrightarrow C\) is called a reproducing kernel function of the Hilbert space H if
-
(a)
\(\forall\tau\in E\), \(K ( \cdot,\tau ) \in H\),
-
(b)
\(\forall\tau\in E\), \(\forall\varphi\in H\), \(\langle\varphi ( \cdot ) ,K ( \cdot,\tau ) \rangle=\varphi ( \tau ) \).
Definition 2
[16]
A Hilbert space H defined on a nonempty set E is called a reproducing kernel Hilbert space if there exists a reproducing kernel function \(K(\eta,\tau)\).
Definition 3
[16]
We define the \(W_{2}^{3}[0,1]\) by
The inner product and the norm in \(W_{2}^{3}[0,1]\) are defined respectively by
and
Definition 4
[16]
We define the space \(F_{2}^{3}[0,T]\) by
with the inner product and norm
and
The space \(F_{2}^{3}[0,T]\) is a reproducing kernel space, and its reproducing kernel function \({r}_{s}\) is given by
Definition 5
[16]
We define the space \(H_{2}^{1}[0,T]\) by
the inner product and norm
and
Its reproducing kernel function \({ q}_{s}\) is
Definition 6
[16]
We define the space \(G_{2}^{1}[0,1]\) by
with the inner product and norm
and
The space \(G_{2}^{1}[0,1]\) is a reproducing kernel space, and its reproducing kernel function \(Q_{y}\) is given by
Theorem 2.1
The reproducing kernel function \(R_{y}\) of \(W_{2}^{3} [ 0,1 ] \) is
where
Proof
Let \(u\in W_{2}^{3}[0,1]\) and \(0\leq y\leq1\). Define \(R_{y}\) by (4). Note that
and
By Definition 5 and integration by parts we have
This completes the proof. □
Definition 7
[16]
We define the space \({ W}_{2}^{(3,3)} ( \Omega ) \) by
with the inner product and norm
and
Theorem 2.2
Let \(K_{ ( y,s ) } ( \eta,\tau ) \) be a reproducing kernel function \({ W}_{2}^{(3,3)} ( \Omega ) \). We have
and for any \(u\in{ W}_{2}^{(3,3)} ( \Omega ) \),
and
Definition 8
[16]
We define the space \(\widehat{W}_{2}^{(1,1)} ( \Omega ) \) by
with the inner product and norm
and
\(\widehat{W}_{2}^{(1,1)} ( \Omega ) \) is a reproducing kernel space, and its reproducing kernel function \(G_{ ( y,s ) } ( \eta ,\tau ) \) is given as
3 Solutions in \({ W}_{2}^{(3,3)}(\Omega)\)
In this section, we give the solution of (1)-(3) in the reproducing kernel space \({ W}_{2}^{(3,3)}(\Omega)\). We define the linear operator \(L:{ W}_{2}^{(3,3)}(\Omega)\rightarrow\widehat{W}_{2}^{(1,1)}(\Omega)\) as
If we homogenize the conditions of the model problem (1)-(3), then it changes to the following problem:
where
and
with \(h_{1}(0)\neq0\).
Lemma 3.1
The operator L is bounded linear.
Proof
By Definition 8 we have
Since
from the continuity of \(K_{ ( { \eta,\tau} ) } ( \xi ,\gamma ) \) we have
Accordingly, for \(i=0,1\),
and then
Therefore,
where \(A=\sum_{i=0}^{1} ( e_{i}^{2}+\tau f_{i}^{2} ) \). □
Now, choose a countable dense subset \(\{ ( \eta_{1},\tau _{1} ) , ( \eta_{2},\tau_{2} ) ,\dots \} \) in Ω and define
where \(L^{\ast}\) is the adjoint operator of L. The orthonormal system \(\{ \widehat{\Psi}_{i}(\eta,\tau) \} _{i=1}^{\infty}\) of \(W_{2}^{(3,3)} ( \Omega ) \) can be obtained by the Gram-Schmidt orthogonalization of \(\{ \Psi_{i}(\eta,\tau) \} _{i=1}^{\infty}\) as
Theorem 3.2
Assume that \(\{ (\eta_{i},\tau_{i}) \} _{i=1}^{\infty}\) is dense in Ω. Then \(\{ \Psi_{i}(\eta ,\tau ) \} _{i=1}^{\infty}\) is a complete system in \({ W}_{2}^{(3,3)}(\Omega)\), and
Proof
We have
Clearly, \(\Psi_{i}(\eta,\tau)\in W ( \Omega ) \). For each fixed \(u(\eta,\tau)\in{ W}_{2}^{(3,3)}(\Omega)\), if
then
Since \(\{ (\eta_{i},\tau_{i}) \} _{i=1}^{\infty}\) is dense in Ω, \(( Lu ) ( \eta,\tau ) =0\). Therefore, \(u=0\) by the existence of \(L^{-1}\). □
Theorem 3.3
If \(\{ (\eta_{i},\tau_{i}) \} _{i=1}^{\infty}\) is dense in Ω, then the solution of (5) is
Proof
The system \(\{ \Psi_{i}(\eta,\tau) \} _{i=1}^{\infty}\) is complete in \({ W}_{2}^{(3,3)}(\Omega)\). Therefore, we get
This completes the proof. □
Now an approximate solution \(u_{n}\) can be obtained from the n-term intercept of the exact solution u:
Obviously,
4 The method implementation
If M is linear, then the analytical solution of (5) can be obtained directly by (6). If M is nonlinear, then the solution of (5) can be obtained either by (6) or by an iterative method as follows. We construct an iterative sequence \(u_{n}\) by putting
where
Lemma 4.1
If
then
Proof
By the reproducing property and Cauchy-Schwarz inequality we have
Thus, we obtain
and
One the one hand, we have
on the other hand, we get
Using these inequalities with \(u_{n}\stackrel{\Vert \cdot \Vert }{\rightarrow}\widehat{u}\), we find
Therefore, as \(n\rightarrow\infty\), using the boundedness of \(\Vert u_{n}\Vert \) gives
As \(n\rightarrow\infty\), with the continuity of \(M(\eta,\tau)\) we get
This completes the proof. □
Theorem 4.2
Assume that \(\Vert u_{n}\Vert \) is a bounded in (7) and that (5) has a unique solution. If \(\{ (\eta _{i},\tau_{i}) \} _{i=1}^{\infty}\) is dense in \({ W}_{2}^{(3,3)} ( \Omega ) \), then the n-term approximate solutions \(u_{n}(\eta,\tau)\) converge to the analytical solution \(u(\eta,\tau)\) of (5), and
where \(A_{i}\) is given by (8).
Proof
First, we prove the convergence of \(u_{n}(\eta,\tau)\). From (7) we infer that
The orthonormality of \(\{ \widehat{\Psi}_{i} \} _{i=1}^{\infty } \) yields that
In terms of (9), we have that \(\Vert u_{n+1}\Vert >\Vert u_{n}\Vert \). Since \(\Vert u_{n}\Vert \) is bounded, \(\Vert u_{n}\Vert \) is convergent, and there exists a constant c such that
This implies that
If \(m>n\), then
Since
we have
The completeness of \({ W}_{2}^{(3,3)}(\Omega)\) shows that \(u_{n}\rightarrow\widehat{u}\) as \(n\rightarrow\infty\). We have
Note that
and
Therefore,
In view of (8), we have
Since \(\{ (\eta_{i},\tau_{i}) \} _{i=1}^{\infty}\) is dense in Ω, for each \((y,s)\in\Omega\), there exists a subsequence \(\{ ( \eta_{n_{j}},\tau_{n_{j}} ) \} _{j=1}^{\infty}\) such that
We know that
Let \(j\rightarrow\infty\); by the continuity of M we have
which proves that \(\widehat{u}(\eta,\tau)\) satisfies (5). □
We obtain an approximate solution \(\zeta_{n}(t)\) as
Remark
Let consider a countable dense set
and define
Then the coefficients \(\beta_{ik}\) can be found by
5 Numerical experiments
In this section, we solve two examples were solved with RKM. We show our results by tables and figures. The numerical results are compared with exact solutions and existing numerical approximations to illustrate the efficiency and high accuracy of the method. The method presents the solutions in terms of convergent series with easily computable components and improves the convergence of the series solution. The method was used in a direct way without using restrictive assumptions. Throughout this work, all computations are implemented by using Maple 16 software package.
Example 5.1
Let us consider the problem with the following initial conditions:
The exact solution is [28]
After homogenizing the initial conditions and using our method, we obtain the results presented in Tables 1-3 and Figures 1-4.
Example 5.2
We solve the SG equation (1) in the region Ω with the following initial conditions:
The exact solution is [27]
After homogenizing the initial conditions by RKM, we get the results presented in Tables 4-16 and Figures 5-8.
Remark
In Tables 1-16, we abbreviate the exact solution and the approximate solution by AS and ES, respectively. AE stands for the absolute error, that is, the absolute value of the difference of the exact and approximate solutions, whereas RE indicates the relative error, that is the absolute error divided by the absolute value of the exact solution.
6 Conclusion
Linear and nonlinear SG equations were investigated by RKM in this work. Homogenizing the initial and boundary conditions is very crucial for this method. We gave a general transformation to homogenize the conditions. This transformation will be very useful for researches who study RKM. We obtained very accurate numerical results and showed them by tables and figures. The computational results confirmed the efficiency, reliability, and accuracy of our method, which is easily applicable. RKM produced a rapidly convergent series with easily computable components using symbolic computation software. The results obtained by RKM are very effective and convenient with less computational work and time.
References
Polyanin, AD, Valentin, FZ: Handbook of Nonlinear Partial Differential Equations. Chapman & Hall/CRC, Boca Raton (2004) xx+814 pp. ISBN:1-58488-355-3
Ramamurti, R: Solitons and instantons. In: An Introduction to Solitons and Instantons in Quantum Field Theory. North-Holland, Amsterdam (1982) viii+409 pp. ISBN:0-444-86229-3
Akbar, M, Dehghan, M: High-order solution of one-dimensional sine-Gordon equation using compact finite difference and DIRKN methods. Math. Comput. Model. 51(5-6), 537-549 (2010)
Scott, A: Nonlinear Science. Emergence and Dynamics of Coherent Structures, 2nd edn. Oxford Texts in Applied and Engineering Mathematics, vol. 8. Oxford University Press, Oxford (2003) xxiv+480 pp. ISBN:0-19-852852-3
Dauxois, T, Peyrard, M: Physics of Solitons. Cambridge University Press, Cambridge (2006)
Dehghan, M, Shokri, A: A numerical method for one-dimensional nonlinear sine-Gordon equation using collocation and radial basis functions. Numer. Methods Partial Differ. Equ. 24(2), 687-698 (2008)
Dehghan, M, Davoud, M: The boundary integral equation approach for numerical solution of the one-dimensional sine-Gordon equation. Numer. Methods Partial Differ. Equ. 24(6), 1405-1415 (2008)
Bratsos, AG: A third order numerical scheme for the two-dimensional sine-Gordon equation. Math. Comput. Simul. 76(4), 271-282 (2007)
Bratsos, AG: A numerical method for the one-dimensional sine-Gordon equation. Numer. Methods Partial Differ. Equ. 24(3), 833-844 (2008)
Dehghan, M, Shokri, A: A numerical method for solution of the two-dimensional sine-Gordon equation using the radial basis functions. Math. Comput. Simul. 79(3), 700-715 (2008)
Lakestani, M, Dehghan, M: Collocation and finite difference-collocation methods for the solution of nonlinear Klein-Gordon equation. Comput. Phys. Commun. 181(8), 1392-1401 (2010)
Dehghan, M, Farhad, FI: The spectral collocation method with three different bases for solving a nonlinear partial differential equation arising in modeling of nonlinear waves. Math. Comput. Model. 53(9-10), 1865-1877 (2011)
Ahmed, H, Ahmed, A: Chebyshev collocation spectral method for solving the RLW equation. Int. J. Nonlinear Sci. 7(2), 131-142 (2009)
Ma, ML, Wu, ZM: A numerical method for one-dimensional nonlinear sine-Gordon equation using multiquadric quasi-interpolation. Chin. Phys. B 18, 3099-3103 (2009)
Aronszajn, N: Theory of reproducing kernels. Trans. Am. Math. Soc. 68, 337-404 (1950)
Cui, M, Lin, Y: Nonlinear Numerical Analysis in the Reproducing Kernel Space. Nova Science Publishers, New York (2009) xiv+226 pp. ISBN:978-1-60456-468-6; 1-60456-468-7
Geng, F, Cui, M, Zhang, B: Method for solving nonlinear initial value problems by combining homotopy perturbation and reproducing kernel Hilbert spaces methods. Nonlinear Anal., Real World Appl. 11, 637-644 (2010)
Mohammadi, M, Mokhtari, R: Solving the generalized regularized long wave equation on the basis of a reproducing kernel space. J. Comput. Appl. Math. 235, 4003-4014 (2011)
Jiang, W, Lin, Y: Representation of exact solution for the time-fractional telegraph equation in the reproducing kernel space. Commun. Nonlinear Sci. Numer. Simul. 16, 3639-3645 (2011)
Wang, Y, Su, L, Cao, X, Li, X: Using reproducing kernel for solving a class of singularly perturbed problems. Comput. Math. Appl. 61, 421-430 (2011)
Wu, B, Xiu, YL: A new algorithm for a class of linear nonlocal boundary value problems based on the reproducing kernel method. Appl. Math. Lett. 24, 156-159 (2011)
Yao, H, Lin, Y: New algorithm for solving a nonlinear hyperbolic telegraph equation with an integral condition. Int. J. Numer. Methods Biomed. Eng. 27, 1558-1568 (2011)
Inc, M, Akgül, A: The reproducing kernel Hilbert space method for solving Troesch’s problem. J. Assoc. Arab Univ. Basic Appl. Sci. 14, 19-27 (2013)
Inc, M, Akgül, A, Geng, F: Reproducing kernel Hilbert space method for solving Bratu’s problem. Bull. Malays. Math. Soc. 38(1), 271-287 (2015)
Inc, M, Akgül, A, Kilicman, A: Explicit solution of telegraph equation based on reproducing kernel method. J. Funct. Spaces Appl. 2012, Article ID 984682 (2012)
Zhang, S, Lei, L, LuHong, D: Reproducing kernel functions represented by form of polynomials. In: Proceedings of the Second Symposium International Computer Science and Computational Technology (ISCSCT ’09), Huangshan, P.R. China, 26-28 December, pp. 353-358 (2009)
Sari, M, Gürhan, G: A sixth-order compact finite difference method for the one-dimensional sine-Gordon equation. Int. J. Numer. Methods Biomed. Eng. 27(7), 1126-1138 (2011)
Jiang, ZW, Wang, RH: Numerical solution of one dimensional sine-Gordon equation using high accuracy multiquadratic quasi-interpolation. Appl. Math. Comput. 218(15), 7711-7716 (2012)
Lu, J: An analytic approach to the sine-Gordon equation using the modified homotopy perturbation method. Comput. Math. Appl. 58, 2313-2319 (2009)
Kaya, D: A numerical solution of the sine-Gordon equation using the modified decomposition method. Appl. Math. Comput. 143, 309-317 (2003)
Acknowledgements
This paper is a part of the PhD thesis of the first author. The authors would like to thank to the referees for their very useful comments and remarks.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors have read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Akgül, A., Inc, M., Kilicman, A. et al. A new approach for one-dimensional sine-Gordon equation. Adv Differ Equ 2016, 8 (2016). https://doi.org/10.1186/s13662-015-0734-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-015-0734-x