Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hypocoercivity for Linear ODEs and Strong Stability for Runge--Kutta Methods

Published 30 Oct 2023 in math.NA and cs.NA | (2310.19758v1)

Abstract: In this note, we connect two different topics from linear algebra and numerical analysis: hypocoercivity of semi-dissipative matrices and strong stability for explicit Runge--Kutta schemes. Linear autonomous ODE systems with a non-coercive matrix are called hypocoercive if they still exhibit uniform exponential decay towards the steady state. Strong stability is a property of time-integration schemes for ODEs that preserve the temporal monotonicity of the discrete solutions. It is proved that explicit Runge--Kutta schemes are strongly stable with respect to semi-dissipative, asymptotically stable matrices if the hypocoercivity index is sufficiently small compared to the order of the scheme. Otherwise, the Runge--Kutta schemes are in general not strongly stable. As a corollary, explicit Runge--Kutta schemes of order $p\in 4\N$ with $s=p$ stages turn out to be \emph{not} strongly stable. This result was proved in \cite{AAJ23}, filling a gap left open in \cite{SunShu19}. Here, we present an alternative, direct proof.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

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.