In this thesis a novel index concept called weak strucutral index of a differential-algebraic equation (DAE) based on its functional dependencies is proposed and proven to be a lower bound of the well-known differential index. A graph-theoretic interpretation of a DAE allows the construction of an algorithm, which calculates this lower bound iteratively with the system's pattern matrix as its only input. By proving an upper bound of the weak structural index, an efficient stopping criterion can be implemented and the DAE's structural unsolvability is detected, if this situation arises. Together with an algorithmic detection of the dependency structure, this new index conceptually forms the framework of an integrated structural analysis.
«
In this thesis a novel index concept called weak strucutral index of a differential-algebraic equation (DAE) based on its functional dependencies is proposed and proven to be a lower bound of the well-known differential index. A graph-theoretic interpretation of a DAE allows the construction of an algorithm, which calculates this lower bound iteratively with the system's pattern matrix as its only input. By proving an upper bound of the weak structural index, an efficient stopping criterion can...
»