Authors: Pablo Zimmermann; Joaquín Fernández; Ernesto Kofman.
Resumen: 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.
Meeting type: Workshop.
Type of job: Artículo Completo.
Production: Set-based graph methods for fast equation sorting in large DAE systems.
Scientific meeting: 9th International Workshop on Equation-based Object-oriented Modeling Languages and Tools.
Meeting place: Berlin.
It's published?: Yes
Publication place: New York
Meeting month: 11