This paper shows how to obtain cheap initial guesses for the solution of the nonlinear systems that must be solved at each step when an implicit Runge-Kutta (IRK) method is applied to a semi-explicit index one differential-algebraic equations (DAE). Given \(y_{n-1}\) and \(Y_n\) (the vector of stage values) from the previous step a method of the form \(Y^{(0)}_{n+1}= b_0\otimes y_{n-1}+ (B\otimes I_m) Y_n\) is used for both the differential and algebraic components. These methods do not have additional cost and inherit the stage order properties of the underlying method.
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- scientific article; zbMATH DE number 176990 (Why is no real title available?)
- The numerical solution of differential-algebraic systems by Runge-Kutta methods
- The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
- IRK methods for index 2 and 3 DAEs: Starting algorithms
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- Starting algorithms for some DIRK methods
- Starting algorithms for low stage order RKN methods
- Are high order variable step equistage initializers better than standard starting algorithms?
- Starting algorithms for a class of RK methods for index-2 DAEs
- Stage value predictors for additive and partitioned Runge-Kutta methods
- scientific article; zbMATH DE number 2053009 (Why is no real title available?)
- scientific article; zbMATH DE number 947433 (Why is no real title available?)
- scientific article; zbMATH DE number 783947 (Why is no real title available?)
- An efficient scheme for the implementation of implicit Runge-Kutta methods
This page was built for publication: IRK methods for DAE: Starting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964104)
