IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v250y2026icp362-375.html

High-order exponential time differencing methods for third-order evolution equations with stiff linear terms

Author

Listed:
  • Su, Huiling
  • Liu, Fei

Abstract

Efficient high-order exponential time differencing methods are proposed for third-order evolution equations with non-periodic boundary conditions in one space dimension. A dual-Petrov–Galerkin spectral method is used to discretize the spatial variables. The trial functions are selected to satisfy boundary conditions of the differential equation, and avoid handling boundary conditions at each time step. The spatial semi-discretization leads to a system of ordinary differential equations (ODEs) in time. The stiff system of ODEs is solved by two exponential time-differencing (ETD) schemes: ETD spectral deferred correction (ETDSDC) method and ETD Runge–Kutta (ETDRK) formula. Since the third-order differential operator is not symmetric, the stiff systems of ODEs have nondiagonal linear part. The coefficients of ETD schemes are numerically calculated by means of numerical integration of auxiliary problems. We rewrite the high-order ETDSDC and ETDRK in terms of the solutions to these auxiliary problems and practically examine the accuracy and computational performance of these methods for the generalized Korteweg–de Vries (gKdV) equations. Ample numerical results show that our proposed algorithms are particularly suitable for long time accurate simulations of various KdV-type equations.

Suggested Citation

  • Su, Huiling & Liu, Fei, 2026. "High-order exponential time differencing methods for third-order evolution equations with stiff linear terms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 250(C), pages 362-375.
  • Handle: RePEc:eee:matcom:v:250:y:2026:i:c:p:362-375
    DOI: 10.1016/j.matcom.2026.06.034
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2026.06.034?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:matcom:v:250:y:2026:i:c:p:362-375. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.