Resumen de ESDIRK methods fro index 2 dae: starting algorithms

T. Roldán

• When semi-explicit differential-algebraic equations are solved with implicit Runge- Kutta methods, the computational effort is dominated by the cost of solving the non-linear systems and therefore it is important to have good starting values to begin the iterations. In this paper we show how to construct an efficient starting algorithm, without additional computational cost, for a class of Runge-Kutta methods in the case of index-2 DAEs.