Monotonicity and boundedness in implicit Runge-Kutta methods

From MaRDI portal





This paper concerns the analysis of implicit Runge-Kutta methods for approximating the solutions to stiff initial value problems. The analysis includes the case of (nonlinear) systems of differential equations that are essentially more general than the classical test equation \(U'=\lambda U\) (with \(\lambda\) a complex constant). The properties of monotonicity and boundedness of a method refer to specific moderate rates of growth of the approximations during the numerical calculations. This paper provides necessary conditions for these properties by using the important concept of algebraic stability (introduced by Burrage, Butcher and Crouzeix). These properties will also be related to the concept of contractivity (B- stability) and to a weakened version of contractivity.











This page was built for publication: Monotonicity and boundedness in implicit Runge-Kutta methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069275)