On the starting algorithms for fully implicit Runge-Kutta methods
Two types of starting algorithms for solving the algebraic equations arising in the case of fully implicit Runge-Kutta methods for stiff initial value problems are investigated. Their order is related to their efficiency in the case of non-stiff and stiff problems and low required tolerance (global errors). Numerical experiments with four different forms of starting algorithms applied to the Van der Pol and Oregonator models illustrate the theory.
scientific article; zbMATH DE number 1556489