Abstract:
Difference schemes of the Euler and trapezoidal types for the numerical solution of the initial-value problem for linear differential-algebraic equations are examined. These schemes are analyzed for model examples, and their superiority over the familiar first- and second-order implicit methods is shown. Conditions for the convergence of the proposed algorithms are formulated.