Simplified explicit exponential Runge-Kutta methods without order reduction
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 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. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.