High order linearly implicit methods for semilinear evolution PDEs

This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in [21] 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ödinger equations and heat equations as main examples but our results extend beyond these two classes of evolution PDEs. We illustrate our main result numerically in dimensions 1 and 2, and we compare the efficiency of the linearly implicit methods with other methods from the literature. We also illustrate numerically the necessity of the stability conditions of our main result.

Authors

Publication Details

Journal
SMAI Journal of Computational Mathematics
Published
2024-11-19
DOI
https://doi.org/10.5802/smai-jcm.111
Primary Topic
Numerical methods for differential equations
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

High order linearly implicit methods for semilinear evolution PDEs

Guillaume Dujardin, Ingrid Lacroix–Violet
SMAI Journal of Computational Mathematics
Numerical methods for differential equations
article

High order linearly implicit methods for semilinear evolution PDEs

Guillaume Dujardin, Ingrid Lacroix–Violet
article en

Abstract

This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in [21] 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ödinger equations and heat equations as main examples but our results extend beyond these two classes of evolution PDEs. We illustrate our main result numerically in dimensions 1 and 2, and we compare the efficiency of the linearly implicit methods with other methods from the literature. We also illustrate numerically the necessity of the stability conditions of our main result.

SMAI Journal of Computational MathematicsVol. 10
Agence Nationale de la Recherche
Openalex Percentile: Top 68%
Numerical methods for differential equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.