A method for finding all connections in the Pantelides algorithm for delay differential-algebraic equations
DOI:
https://doi.org/10.14464/gammas.v4i1.503Keywords:
delay differential-algebraic equation, Pantelides algorithm, structural analysis, enumeration algorithm, spanning treeAbstract
The Pantelides algorithm for systems of delay differential-algebraic equations (DDAEs) is a method to structurally analyse such systems with the goal to detect which equations have to be differentiated or shifted to construct a solution. In this process, one has to detect implicit connections between equations in the shifting graph, making it necessary to check all possible connections. The problem of finding these efficiently remained unsolved so far. It is explored in further detail and a reformulation is introduced. Additionally, an algorithmic approach for its solution is presented.
Downloads
Additional Files
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Daniel Collin

This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to share and adapt as long as you give appropriate credit, provide a link to the license and do not add restrictions. The copyright remains with the author.
For more informations please read the detailed License Agreement.