Convergence of multistep discretizations of DAEs (Q1899928): Difference between revisions

The authors consider semi-explicit differential algebraic equations (DAE) of the following typ: \(\dot x = f(x,y)\), \(0 = g(x,y)\) of the indices 1 and 2. They give an analysis of DAE discretizations by linear multistep methods and their one-leg twins, investigating uniform stepsize convergence for partitioned methods -- compound linear multistep and one-leg discretizations. The conclusion is that the most useful discretizations are those which avoid discretization of the constraint.