IRK Methods for Index 2 and 3 DAEs: Starting Algorithms

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. That is why it is important to have good starting values to begin the iterations. In this paper we study a type of starting algorithms, without additional computational cost, in the case of index-2 and index-3 DAEs. The order of the starting values is defined, and by using DA-series and rooted trees we obtain their general order conditions. If the RK method satisfies some simplifying assumptions, then the maximum order can be obtained.