High order linearly implicit methods for semilinear evolution PDEs
Guillaume Dujardin (Paradyse, LPP), Ingrid Lacroix-Violet (IECL)

TL;DR
This paper develops and analyzes high order linearly implicit numerical methods for semilinear evolution PDEs, demonstrating their stability, convergence, and efficiency through theoretical proofs and numerical experiments.
Contribution
It introduces stability notions and proves high order convergence of linearly implicit methods for PDEs, extending previous ODE results to PDE contexts.
Findings
Methods achieve high order convergence under stability conditions
Numerical experiments confirm efficiency and stability
Comparison shows advantages over existing methods
Abstract
This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in a previous paper in the ODE setting. These methods use a collocation Runge--Kutta method as a basis, and additional variables that are updated explicitly and make the implicit part of the collocation Runge--Kutta method only linearly implicit. In this paper, we introduce several notions of stability for the underlying Runge--Kutta methods as well as for the explicit step on the additional variables necessary to fit the context of evolution PDE. We prove a main theorem about the high order of convergence of these linearly implicit methods in this PDE setting, using the stability hypotheses introduced before. We use nonlinear Schr\''odinger equations and heat equations as main examples but our results extend beyond these two classes of evolution PDEs. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Iterative Methods for Nonlinear Equations · Advanced Numerical Methods in Computational Mathematics
