Jump to content

Pantelides algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by InternetArchiveBot (talk | contribs) at 17:04, 11 March 2018 (Rescuing 1 sources and tagging 0 as dead. #IABot (v1.6.4)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Pantelides algorithm gives a systematic method for reducing high-index systems of differential-algebraic equations to lower index, by selectively adding differentiated forms of the equations already present in the system.[1][2][3] It is possible for the algorithm to fail in some instances.

Pantelides algorithm is implemented in several significant equation-based simulation programs such as gPROMS, Modelica and EMSO.[4][5][6]

References

  1. ^ C Pantelides, The Consistent Initialization of Differential-Algebraic Systems, SIAM J. Sci. and Stat. Comput. Volume 9, Issue 2, pp. 213–231 (March 1988) (the original paper where the algorithm is described)
  2. ^ Francois Cellier, Lecture notes about Pantelides algorithm
  3. ^ John Pye, Pantelides Algorithm in PHP Archived 2011-04-13 at the Wayback Machine (source code in PHP language)
  4. ^ Peter A. Fritzson, Principles of Object-Oriented Modeling and Simulation with Modelica 2.1, Wiley, ISBN 0-471-47163-1
  5. ^ R de P. Soares and A R. Secchi, 2005, Direct initialisation and solution of high-index DAE systems, Computer Aided Chemical Engineering 20, doi:10.1016/S1570-7946(05)80148-8.
  6. ^ EMSO a free-to-use closed-source simulator/equation solver that includes implementation for the Pantelides algorithm.