Set-based graph methods for fast equation sorting in large DAE systems

PABLO ZIMMERMANN; JOAQUÍN FERNÁNDEZ; ERNESTO KOFMAN

Berlin

Workshop; 9th International Workshop on Equation-based Object-oriented Modeling Languages and Tools; 2019

This paper introduces new algorithms for the efficient conversion oflarge sets of DAEs into ODEs based on the extension of maximummatching and Tarjan?s strongly connected component algorithmsusing a novel concept of Set?Based Graph. These algorithms havethe capability of solving the problems without expanding the arraysof unknowns and without unrolling the for-loop equations so thatthe complexity becomes independent on the size of the arrays. Theimplementation of the new algorithms in an experimental Modelicacompiler is also described and two examples are presented