IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v241y2026ipbp205-224.html
   My bibliography  Save this article

High-order and energy-preserving relaxed implicit–explicit Runge–Kutta methods for Hamiltonian PDEs

Author

Listed:
  • Cui, Lei
  • Huang, Qiong-Ao
  • Zhang, Gengen

Abstract

This work presents a mathematical framework to develop energy-preserving, high-order linearly implicit Runge–Kutta (RK) methods for general Hamiltonian PDEs. This reformulation results in a two-stage second-order IMEX-RK method that is unconditionally energy-stable, with its diagonally implicit part satisfying the symplectic condition. In contrast, the search for a third-order IMEX-RK scheme that similarly guarantees unconditional energy-stable has been unsuccessful. To achieve a higher-order energy-preserving scheme, we incorporate a relaxation factor into the conventional IMEX-RK method, leading to the development of a class of high-order relaxed IMEX-RK (RIMEX-RK) methods. A rigorous theoretical analysis demonstrates the derived methods’ energy stability and error convergence. Key advantages of the RIMEX-RK methods include their one-step nature, high-order accuracy, energy preservation, and ease of implementation. Extensive numerical experiments demonstrate the framework’s superior performance.

Suggested Citation

  • Cui, Lei & Huang, Qiong-Ao & Zhang, Gengen, 2026. "High-order and energy-preserving relaxed implicit–explicit Runge–Kutta methods for Hamiltonian PDEs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PB), pages 205-224.
  • Handle: RePEc:eee:matcom:v:241:y:2026:i:pb:p:205-224
    DOI: 10.1016/j.matcom.2025.10.012
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.10.012?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:241:y:2026:i:pb:p:205-224. 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.