High order linearly implicit methods for evolution equations: How to solve an ODE by inverting only linear systems

by   Guillaume Dujardin, et al.

This paper introduces a new class of numerical methods for the time integration of evolution equations set as Cauchy problems of ODEs or PDEs. The systematic design of these methods mixes the Runge-Kutta collocation formalism with collocation techniques, in such a way that the methods are linearly implicit and have high order. The fact that these methods are implicit allows to avoid CFL conditions when the large systems to integrate come from the space discretization of evolution PDEs. Moreover, these methods are expected to be efficient since they only require to solve one linear system of equations at each time step, and efficient techniques from the literature can be used to do so. After the introduction of the methods, we set suitable definitions of consistency and stability for these methods. This allows for a proof that arbitrarily high order linearly implicit methods exist and converge when applied to ODEs. Eventually, we perform numerical experiments on ODEs and PDEs that illustrate our theoretical results for ODEs, and compare our methods with standard methods for several evolution PDEs.


page 1

page 2

page 3

page 4


High order linearly implicit methods for semilinear evolution PDEs

This paper considers the numerical integration of semilinear evolution P...

High order semi-implicit multistep methods for time dependent partial differential equations

We consider the construction of semi-implicit linear multistep methods w...

Robust Convergence of Parareal Algorithms with Arbitrarily High-order Fine Propagators

The aim of this paper is to analyze the robust convergence of a class of...

C1 Triangular Isogeometric Analysis of the von Karman Equations

In this paper, we report the use of rational Triangular Bezier Splines (...

A new efficient explicit Deferred Correction framework: analysis and applications to hyperbolic PDEs and adaptivity

The Deferred Correction is an iterative procedure used to design numeric...

An implicit symplectic solver for high-precision long term integrations of the Solar System

Compared to other symplectic integrators (the Wisdom and Holman map and ...

Multirate Linearly-Implicit GARK Schemes

Many complex applications require the solution of initial-value problems...

Please sign up or login with your details

Forgot password? Click here to reset