Projective integration methods in the Runge–Kutta framework and the extension to adaptivity in time

Projective Integration methods are explicit time integration schemes for stiff ODEs with large spectral gaps. In this paper, we show that all existing Projective Integration methods can be written as Runge–Kutta methods with an extended Butcher tableau including many stages. We prove consistency and order conditions of the Projective Integration methods using the Runge–Kutta framework. Spatially adaptive Projective Integration methods are included via partitioned Runge–Kutta methods. New time adaptive Projective Integration schemes are derived via embedded Runge–Kutta methods and step size variation while their accuracy, stability, convergence, and error estimators are investigated analytically and numerically.