\^A-and \^I-stability of collocation Runge-Kutta methods

Abstract

This paper deals with stability of classical Runge-Kutta collocation methods. When such methods are embedded in linearly implicit methods as developed in [12] and used in [13] for the time integration of nonlinear evolution PDEs, the stability of these methods has to be adapted to this context. For this reason, we develop in this paper several notions of stability, that we analyze. We provide sufficient conditions that can be checked algorithmically to ensure that these stability notions are fulfilled by a given Runge-Kutta collocation method. We also introduce examples and counterexamples used in [13] to highlight the necessity of these stability conditions in this context