Partitioning ordinary differential equations using Runge-Kutta methods

From MaRDI portal





This paper considers a partitioning strategy for an ordinary differential equation into stiff and non-stiff subsystems based on the non-convergence of an initial non-stiff process and a numerical solution based on a three stage semi-implicit Runge-Kutta method with Newton or fixed point implementation. Some numerical results are presented.











This page was built for publication: Partitioning ordinary differential equations using Runge-Kutta methods

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