Article ID Journal Published Year Pages File Type
10325715 Journal of Symbolic Computation 2011 25 Pages PDF
Abstract
This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (a differential Kronecker representation) in as many variables as the order of the input system. This can be done by means of a Kronecker-type algorithm with bounded complexity.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, , , , ,