Convergence of multistep discretizations of DAEs

Carmen Arévalo, Gustaf Söderlind

Research output: Contribution to journalArticlepeer-review

Abstract

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.
Original languageEnglish
Pages (from-to)143-168
Number of pages26
JournalBIT
Volume35
Issue number2
DOIs
Publication statusPublished - 1995

Subject classification (UKÄ)

  • Computational Mathematics

Free keywords

  • compound multistep methods
  • differential algebraic equations (DAE)
  • multistep methods
  • one-leg methods
  • partitioned methods

Fingerprint

Dive into the research topics of 'Convergence of multistep discretizations of DAEs'. Together they form a unique fingerprint.

Cite this