Papers
Topics
Authors
Recent
2000 character limit reached

Simplified explicit exponential Runge-Kutta methods without order reduction (2307.08389v1)

Published 17 Jul 2023 in math.NA and cs.NA

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. 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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.