Parametric excitation of computational modes inherent to leap-frog scheme applied to the Korteweg-de Vries equation (Q1825014)

From MaRDI portal
Revision as of 11:08, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parametric excitation of computational modes inherent to leap-frog scheme applied to the Korteweg-de Vries equation
scientific article

    Statements

    Parametric excitation of computational modes inherent to leap-frog scheme applied to the Korteweg-de Vries equation (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The problem studied in this paper is the numerical solution of the Korteweg-de Vries equation \(\partial u/\partial t+u(\partial u/\partial x)+\mu (\partial^ 3u/\partial x^ 3)=0\) with periodic boundary conditions \(u(x,t)=u(x+2,t),\) and initial conditions \(u(x,0)=2\epsilon_ k\cos (\pi kx).\) The investigated numerical method is the so called leap- frog scheme: \(u_ j^{n+1}=u_ j^{n-1}-(\Delta t/3\Delta x)(u^ n_{j+1}+u^ n_ j+u^ n_{j-1})(u^ n_{j+1}-u^ n_{j-1})-\mu (\Delta t/\Delta x^ 3)(u^ n_{j+2}-2u^ n_{j+1}+2u^ n_{j-1}- u^ n_{j-2}).\) It is shown that the numerical solution obtained by this method consists of physical and computational components. Moreover the authors can to separate these components. A method to suppress the computational component is given using a more exact explicit one-step method combined with some implicit step to determine \(u^{n+1}\). The effectiveness of this method is demonstrated by several computational results.
    0 references
    0 references
    0 references
    0 references
    0 references
    nonlinear instability
    0 references
    finite difference schemes
    0 references
    numerical examples
    0 references
    Korteweg-de Vries equation
    0 references
    periodic boundary conditions
    0 references
    leap-frog scheme
    0 references
    explicit one-step method
    0 references
    0 references