Journal of Computational Methods in Physics

Journal of Computational Methods in Physics / 2014 / Article

Research Article | Open Access

Volume 2014 |Article ID 392962 | https://doi.org/10.1155/2014/392962

Edson Pindza, Eben Maré, "Sinc Collocation Method for Solving the Benjamin-Ono Equation", Journal of Computational Methods in Physics, vol. 2014, Article ID 392962, 8 pages, 2014. https://doi.org/10.1155/2014/392962

Sinc Collocation Method for Solving the Benjamin-Ono Equation

Academic Editor: Ali Cemal Benim
Received22 Mar 2014
Accepted17 Jun 2014
Published23 Jul 2014

Abstract

We propose a simple, though powerful, technique for numerical solutions of the Benjamin-Ono equation. This approach is based on a global collocation method using Sinc basis functions. Some properties of the Sinc collocation method required for our subsequent development are given and utilized to reduce the computation of the Benjamin-Ono equation to a system of ordinary differential equations. The propagation of one soliton and the interaction of two solitons are used to validate our numerical method. The method is easy to implement and yields accurate results.

1. Introduction

It is well known that nonlinear partial differential equations (NPDEs) are widely used to describe complex phenomena in various fields of sciences, such as physics, biology, and chemistry.

In this paper, we consider the initial value problem for the Benjamin-Ono (BO) equation of the form together with the following initial and the boundary conditions: Here is a real valued function and denotes the Hilbert transform defined and described by [1] (amongst others): where denotes the Cauchy principal value. This equation was derived by Benjamin [2] and later by Ono [3] as a model for one-dimensional waves in deep water and it has a close relation with the famous KdV equation which models long waves in shallow water [4].

We recall that the BO equation has an infinite sequence of invariants [5], the first three of which are The BO has been shown to admit rational analytical soliton solutions in and [6]. However, for a given arbitrary initial condition, finding analytical solutions of the BO equation becomes an intractable problem. Therefore the use of numerical methods plays an important role in the study of the dynamics of the BO equation.

James and Weideman [7] used the Fourier method which implicitly assumes the periodicity of the boundary conditions and a method based on rational approximating function to compute numerical solutions of the BO. The rational method was shown to have spectacular accuracy for solutions that do not wander too far from the origin while, for long dated solutions, the Fourier method was shown to retain superior accuracy. Miloh et al. [8] proposed an efficient pseudospectral method for the numerical solution of the weakly nonlinear Benjamin-Ono equation for arbitrary initial conditions and suggested a practical new relationship for estimating the number of solitons in terms of arbitrary initial conditions. Thomée and Vsaudeva Murthy [9] used the Crank-Nicolson approximation in time and finite difference approximations in space to solve the BO equation. They treated the nonlinear term in a standard conservative fashion and discretized the Hilbert transform by a quadrature formula which was computed efficiently using the fast Fourier transform. Recently, Boyd and Xu [10] compared three spectral methods for solving the Benjamin-Ono equation, Fourier pseudospectral, rational Christov functions, and Gaussian radial basis functions. They highlighted the advantages and the disadvantages of each numerical method. For instance, the Fourier pseudospectral method is very fast through use of the fast Fourier transform (FFT), but requires domain truncation which is unnecessary for a rational basis. Radial basis functions are slow for a given number of grid points; however, they have a very flexible grid adaptation. To the best of our knowledge, there are no records regarding numerical solutions of the BO equation by using Sinc numerical methods.

In this paper, we propose a Sinc collocation method for solving the BO equation. Sinc numerical methods for solving ordinary and partial differential equations have increasingly become popular and have been extensively studied, in particular, for problems on unbounded domains and those having singularity at boundaries. The first Sinc method was introduced by Stenger [11] to solve two-point boundary value problems for second order differential equations. In the field of nonlinear partial differential equations, the use of Sinc numerical methods has shown tremendous potential. For instance, Al-Khaled [12] showed the utility of the Sinc Galerkin method for solving the Korteweg-de Vries equation. Recently, Mokhtari and Mohammadi [13] presented a meshfree method based on the Sinc collocation method to solve the generalized regularized long wave equation. Excellent overviews of the existing Sinc methods for solving ODEs, PDEs, and integral equations can be found in [14, 15].

The layout of this paper is as follows. We describe the formulation of the Sinc collocation method and the discretization of the Hilbert transform in Section 2. Section 3 is devoted to the Sinc collocation discretization of the BO equation. Furthermore, we examine the stability of the method by using a linearized stability analysis. Numerical results illustrating the merits of the new scheme are given in Section 4. Finally, we present our conclusions in Section 5.

2. Sinc Collocation Methods

In this section, we introduce some useful definitions and pertinent theorems of the Sinc function needed for space discretization of the BO equation. We use to denote the set of all integers, the set of all real numbers, and the set of all complex numbers. Let be a function defined on and the step-size. Then the Whittaker function is defined by the following series: where is given as follows: and the Sinc function defined on the real line is given by Whenever the series given in (5) converges, is approximated by using a finite number of terms. Therefore, for a positive integer , (5) implies The approximation of the th derivative of the function by the Sinc is given by The Sinc collocation method requires derivatives of Sinc functions to be evaluated at collocation points. We can obtain explicit close form expressions for these; namely,

Lemma 1. The Hilbert transform of a function can be approximated by where The entries of the Hilbert transform matrix at collocation point are given by

In order to state the convergence theorem of the Sinc collocation method, we introduce the following notation and definitions.

Definition 2. Let denote the infinite strip region with width ( ) in the complex plane For all , let be defined by Let be the Hardy space over the region , that is, the set of functions such that

One then gets the following convergence results.

Theorem 3 (see [15]). Assume, with positive constants , , and , that
(1) belongs to ;
(2) decays exponentially on the real line; that is, Then we have for some constants and , where the mesh size is taken as

The proof of the above Theorem 3 is beyond the scope of this paper. We refer the reader to [15] for a detailed discussion. Theorem 3 states that, if is an analytic function on an infinite strip containing the real line and allows specific growth restrictions, then it has exponentially decaying absolute errors in the Sinc approximation. Similarly, the approximation of the derivatives and the Hilbert transform of decay exponentially.

3. Construction of the Method

We consider the initial value problem for the Benjamin-Ono equation of the form together with the following initial: and the boundary conditions Here is a real valued function and denotes the Hilbert transform defined by where denotes the Cauchy principal value.

In order to propose an unconditionally stable methodology, we discretize the time derivative of the BO equation using a classic finite difference formula by the -weighted scheme between two successive levels and as where , , and is the time step size.

The nonlinear term in (24) can be approximated by Taylor expansion. We obtain the following formula: Therefore Equation (24) can be rewritten as Now the space variable is discretized into collocation points so that the solution of (20) is interpolated and approximated by means of the Sinc functions as where the basis functions are given by Here is defined as and the two cubic interpolants [14] are introduced to handle the radiation boundary conditions in (22).

The unknown parameters in (29) are to be determined by collocation method. Therefore, for each collocation point , (29) can be written as The substitution of (33) into (27) at collocation points yields the following equation: To obtain the matrix representation of the expression (34), we introduce the following matrix and vector notations: Thus we obtain the following system of linear equations in unknown parameters which can be expressed in a matrix form where in which where symbols “ ” and “ ” mean the component-wise and the matrix multiplications, respectively.

The stability of the approximation (36) is investigated by using the matrix method. The linearized version of (20) is obtained by assuming the quantity in the nonlinear term as a local constant . The error at timestep is defined as where and are the exact and the numerical solutions, respectively. The error matrix equation of the linearized BO equation is given by where and . Now, let ; then (40) becomes The numerical scheme is stable if , or equivalently, ; that is, the spectral radius of the matrix has to be smaller than or equal to one. From (40) it can be seen that the stability conditions are possible if all the eigenvalues of the matrix satisfy the following condition: where and are the eigenvalues of the matrices and , respectively.

For , the relation (42) becomes If both and are complex eigenvalues, we write and . In this case, (43) can be rewritten as The inequality (44) is satisfied if . For real eigenvalues, the inequality (44) holds true for and or and . This shows that scheme (36) is unconditionally stable if for complex eigenvalues and and or and for real eigenvalues.

For , the inequality (42) becomes In other words, Therefore, when , the scheme (42) is conditionally stable.

4. Numerical Results

The analytical soliton solutions of the BO equation are rational functions in and . For example, one and two soliton solutions are given, respectively, by (see [6, 16, 17]) where , , and , , , are arbitrary constants. In this section, we examine the proposed algorithm using different test problems related to the propagation of one soliton and interaction of two soliton solutions. The accuracy of the scheme is measured by using the following error norms: where and represent the exact and approximate solutions, respectively, and is the minimum distance between any two points of set points for which the errors are evaluated. In our computational work, we use the collocation points The BO equation possesses infinite conservation laws [5]; the first three are given as follows: related to the mass, momentum, and energy. The quantities , , and are applied to measure the conservation properties of the collocation scheme calculated by

4.1. Propagation of Single Solitons

In this experiment, we consider the propagation of single solitons of the BO equation. The initial and boundary conditions are extracted from (47) and (22), respectively. The values of the parameters used in the numerical experiments are , , , the number of collocation points , and . The soliton from which the initial condition is extracted (47) moves to the right across the space interval when the time interval is . The numerical tests for this case are performed using the Sinc basis functions.

The error norms , and conservation quantities , , and are computed, which are shown in Table 1. From the numerical results given in Table 1 it is observed that, throughout the simulation, the error norms remain less than and remains less than , whereas the changes of the invariant are less than and the invariants and at a given time are equal to those of the initial value; our scheme is satisfactorily conservative. The numerical solutions at different time levels (a) and the absolute error (b) at time are shown in Figure 1 for , , , the number of collocation points , and in the region .


Time CPU(s)

0 0 0 12.3007 7.5397 10.1788 0.000
10 12.3007 7.5397 10.1788 0.810
30 12.3008 7.5397 10.1788 2.098
50 12.3008 7.5397 10.1788 3.605
70 12.3008 7.5397 10.1788 5.505
90 12.3008 7.5397 10.1788 7.499
110 12.3008 7.5397 10.1788 9.931

In the next experiment, we investigate the convergence of our approach in terms of the number of grid points at time . To ensure that our scheme is not dominated by the time discretization, we choose . We take the parameters such as , , , , , , and .

Figure 2 shows that the error norms and converge exponentially for the propagation of one soliton solutions and for the interaction of two soliton solutions as we increase the number of grid points .

4.2. Interaction of Two Solitons

Our second experiment pertains to the interaction of two soliton solutions of the BO equation having different amplitudes and travelling in the same direction. The initial and boundary conditions are extracted from (47) and (22).

To allow the interaction to occur, the experiment was run from to in the region . Figure 3 shows the interaction of two soliton solutions of BO equation for , , , , , , , and . It can be seen that the faster pulse interacts with and emerges ahead of the lower pulse with the shape and velocity of each soliton retained. Because of the nature of the Sinc discretization, the Hilbert transform and matrix differentiation are explicitly obtained with exponential accuracy. The result in Figure 3 shows numerical interaction of the two soliton solution and its time evolution of the error from to . In Figure 3(b), it is shown that the Sinc discretization maintains accurate results comparable to those given in [7, 10] for a long period. Therefore, a number of properties of the Benjamin-Ono equation can be checked numerically, including the exhibition of no phase shifts after interaction of the solitons.

Numerical check on the conservation mass, momentum, and energy shows that the three quantities remain constant with respect to time as shown in Table 2. Propagation of the single solitary wave and two soliton integrations are simulated well with the proposed algorithms and conservation invariants do not change much during the computer run. Thus Sinc functions can be used to construct approximate numerical methods of the BO equation.


Time CPU(s)

0 0024.0123 12.5716 16.7526 0.000
1 24.0124 12.5716 16.7526 0.278
30 24.0124 12.5716 16.7526 1.833
60 24.0124 12.5716 16.7526 3.854
90 24.0124 12.5716 16.7526 7.016
120 24.0124 12.5716 16.7526 8.961
150 24.0124 12.5716 16.7526 11.351
180 24.0124 12.5716 16.7526 14.142
210 24.0124 12.5716 16.7526 16.748

5. Conclusion

A numerical technique based on the Sinc collocation method has been presented for numerical solutions of the BO equation. The efficiency of the method is tested on the problems of propagation of a single soliton as well as interaction of two solitons. The accuracy of solutions is examined in terms of the , error norms, and the conservation quantities , , and . Stability analysis is performed by the matrix method. The results obtained for the Sinc collocation are very close to analytical ones. Our algorithm was found to be unconditionally stable and exponentially convergent in space and a reliable numerical method for solving the BO equation. The method is easy to implement and compares favourably to Fourier-based spectral methods without any assumptions on periodicity.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

Edson Pindza is thankful to Brad Welch for the financial support from RidgeCape Capital.

References

  1. J. A. C. Weideman, “Computing the Hilbert transform on the real line,” Mathematics of Computation, vol. 64, no. 210, pp. 745–762, 1995. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  2. T. B. Benjamin, “Internal waves of permanent form in fluids of great depth,” Journal of Fluid Mechanics, vol. 29, no. 3, pp. 559–592, 1967. View at: Publisher Site | Google Scholar
  3. H. Ono, “Algebraic solitary waves in stratified fluids,” Journal of the Physical Society of Japan, vol. 39, no. 4, pp. 1082–1091, 1975. View at: Google Scholar | MathSciNet
  4. C. E. Kenig, G. Ponce, and L. Vega, “Well-posedness and scattering results for the generalized Korteweg-de Vries equation via the contraction principle,” Communications on Pure and Applied Mathematics, vol. 46, no. 4, pp. 527–620, 1993. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  5. L. Abdelouhab, J. L. Bona, M. Felland, and J. Saut, “Nonlocal models for nonlinear, dispersive waves,” Physica D, vol. 40, no. 3, pp. 360–392, 1989. View at: Publisher Site | Google Scholar | MathSciNet
  6. J. Satsuma and Y. Ishimori, “Periodic wave and rational soliton solutions of the Benjamin-Ono equation,” Journal of the Physical Society of Japan, vol. 46, no. 2, pp. 681–687, 1979. View at: Publisher Site | Google Scholar
  7. R. L. James and J. A. C. Weideman, “Pseudospectral methods for the Bejamin-Ono equation,” in Advances in Computer Methods for Partial Differential Equations VII, pp. 371–377, 1992. View at: Google Scholar
  8. T. Miloh, M. Prestin, L. Shtilman, and M. P. Tulin, “A note on the numerical and N-soliton solutions of the Benjamin-Ono evolution equation,” Wave Motion, vol. 17, no. 1, pp. 1–10, 1993. View at: Publisher Site | Google Scholar | MathSciNet
  9. V. Thomée and A. S. Vasudeva Murthy, “A numerical method for the Benjamin-Ono equation,” BIT Numerical Mathematics, vol. 38, no. 3, pp. 597–611, 1998. View at: Publisher Site | Google Scholar | MathSciNet
  10. J. P. Boyd and Z. Xu, “Comparison of three spectral methods for the Benjamin-Ono equation: Fourier pseudospectral, rational Christov functions and Gaussian radial basis functions,” Wave Motion, vol. 48, no. 8, pp. 702–706, 2011. View at: Publisher Site | Google Scholar | MathSciNet
  11. F. Stenger, “A Sinc-Galerkin methods for solution of boundary value problems,” Mathematics of Computation, vol. 33, pp. 85–109, 1979. View at: Google Scholar
  12. K. Al-Khaled, “Sinc numerical solution for solitons and solitary waves,” Journal of Computational and Applied Mathematics, vol. 130, no. 1-2, pp. 283–292, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  13. R. Mokhtari and M. Mohammadi, “Numerical solution of GRLW equation using Sinc-collocation method,” Computer Physics Communications, vol. 181, no. 7, pp. 1266–1274, 2010. View at: Publisher Site | Google Scholar | MathSciNet
  14. J. Lund and K. L. Bowers, Sinc Methods For Quadrature and Differential Equations, SIAM, Philadelphia, Pa, USA, 1992. View at: Publisher Site | MathSciNet
  15. F. Stenger, Numerical Methods Based on Sinc and Analytic Functions, Springer, New York, NY, USA, 1993.
  16. Y. Matsuno, “Exact multi-soliton solution of the Benjamin-Ono equation,” Journal of Physics A: Mathematical and General, vol. 12, no. 4, pp. 619–621, 1979. View at: Publisher Site | Google Scholar
  17. Y. Matsuno, “Interaction of the Benjamin-Ono solitons,” Journal of Physics A: Mathematical and General, vol. 13, no. 5, pp. 1519–1536, 1980. View at: Publisher Site | Google Scholar | MathSciNet

Copyright © 2014 Edson Pindza and Eben Maré. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views783
Downloads239
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.