zbMATH — the first resource for mathematics

Numerical solution to a linearized KdV equation on unbounded domain. (English) Zbl 1140.65070
The authors present a numerical simulation of a linearized Korteweg-de Vries (KdV) equation on the whole real axis. A number of theorems is presented for the theoretical foundation and numerical experiments are presented for the validation of the proposed theory. The numerical experiments are quite interesting.

65M60 Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs
35Q53 KdV equations (Korteweg-de Vries equations)
Full Text: DOI
[1] Report of the committee on waves, Report of the 7th Meeting the British Association for the Advancement of Science, 7th Liverpool (1837) 417, London, John Murray, 1999.
[2] , , and , Solitons and nonlinear wave equations, Academic Press, London, 1982. · Zbl 0496.35001
[3] Linear and nonlinear waves, Wiley, New York, 1974.
[4] Jain, Chaos Solitons Fractals 8 pp 943– (1997)
[5] Li, Comput Phys Commun 88 pp 121– (1995)
[6] Zheng, Numer Math 105 pp 315– (2006) · Zbl 1105.65106
[7] Fokas, Comm Pure Appl Math 58 pp 639– (2005)
[8] and , Table of integrals, series, and products, sixth edition, translated from the Russian by Scripta Technica, Inc., Academic Press, London, 2000.
[9] Jiang, Comput Math Appl 47 pp 955– (2004)
[10] and , Fractional calculus: integral and differential equations of fractional order, Fractals and fractional calculus in continuum mechanics, and , editors, Springer, Wien, 1997.
[11] Shen, SIAM J Numer Anal 41 pp 1595– (2003)
[12] Chebyshev and fourier spectral methods, 2nd ed., Dover Publications, Mineola, New York, 2001. · Zbl 0994.65128
[13] Ehrhardt, Riv Math Univ Parma 6 pp 57– (2001)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.