Simplified Explicit Exponential Runge-Kutta Methods Without Order Reduction

Authors

  • Begoña Cano Universidad de Valladolid
  • María Jesús Moreta Universidad Complutense de Madrid

DOI:

https://doi.org/10.4208/jcm.2407-m2023-0131

Keywords:

Exponential Runge-Kutta methods, Avoiding order reduction in time, Efficiency

Abstract

In a previous paper, a technique was suggested to avoid order reduction with any explicit exponential Runge-Kutta method when integrating initial boundary value nonlinear problems with time-dependent boundary conditions. In this paper, we significantly simplify the full discretization formulas to be applied under conditions which are nearly always satisfied in practice. Not only a simpler linear combination of $\varphi_j$-functions is given for both the stages and the solution, but also the information required on the boundary is so much simplified that, in order to get local order three, it is no longer necessary to resort to numerical differentiation in space. In many cases, even to get local order 4. The technique is then shown to be computationally competitive against other widely used methods with high enough stiff order through the standard method of lines.

Author Biographies

  • Begoña Cano

    Departmento de Matemática Aplicada, IMUVA, Universidad de Valladolid, Spain

  • María Jesús Moreta

    Departmento de Análisis Econόmico y Economía Cuantitativa, IMUVA, Universidad Complutense de Madrid, Spain

Published

2025-10-30

Abstract View

  • 4034

Pdf View

  • 196

Issue

Section

Articles

How to Cite

Simplified Explicit Exponential Runge-Kutta Methods Without Order Reduction. (2025). Journal of Computational Mathematics, 43(6), 1604-1620. https://doi.org/10.4208/jcm.2407-m2023-0131