IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v508y2026ics0096300325003467.html
   My bibliography  Save this article

A class of exponential time-stepping mass-momentum-energy-preserving schemes for Korteweg-de Vries equations

Author

Listed:
  • Shi, Wei
  • Fu, Ting
  • Liu, Kai

Abstract

The Korteweg-de Vries (KdV) equation, as a completely integrable equation, possesses infinite number of invariants. In this paper, building upon existing structure-preserving methodologies such as Fourier-Galerkin spectral methods, exponential integrators and discrete gradient-based projection technique, we develop a class of exponential time-stepping invariants-preserving schemes for the numerical integration of the KdV equation. First, a Fourier-Galerkin semidiscretization in spatial direction leads to a system of Ordinary Differential Equations (ODEs). The resulting semi-discrete system of ODEs is a stiff semi-linear system that inherits the invariants-preserving properties of the KdV equation. Then the exponential integrators are applied for the time integration to address stiffness while maintaining explicit efficiency. Meanwhile, a projection technique based on discrete gradient is accompanied to exactly conserve multiple invariants for the semi-discrete system. This yields a class of fully discrete schemes which can conserve the semi-discrete mass, momentum and energy to machine precision. Numerical experiments are carried out to confirm the accuracy order, the conservative property and efficiency of the proposed schemes.

Suggested Citation

  • Shi, Wei & Fu, Ting & Liu, Kai, 2026. "A class of exponential time-stepping mass-momentum-energy-preserving schemes for Korteweg-de Vries equations," Applied Mathematics and Computation, Elsevier, vol. 508(C).
  • Handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003467
    DOI: 10.1016/j.amc.2025.129620
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325003467
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129620?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003467. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.