Efficient matching in large DAE models

DOI10.1145/3674831MaRDI QIDQ7032907zbMATH OpenFDO

Authors Denise Marzorati, Joaquín L. Fernández, Ernesto Kofman

Publication date 4 February 2025

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3674831

zbMATH Keywords

large scale modelsmatchingmodelicaset-based graphs

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Array-aware matching: taming the complexity of large-scale simulation models
• Compact sparse symbolic Jacobian computation in large systems of ODEs
• Computer modeling and simulation of dynamic systems using Wolfram SystemModeler
• Continuous system simulation
• Depth-First Search and Linear Graph Algorithms
• Efficient connection processing in equation-based object-oriented models
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 1151367 (Why is no real title available?)
• Matching theory
• Modeling and simulation of large-scale systems: a systematic comparison of modeling paradigms
• Paths, Trees, and Flowers
• The Consistent Initialization of Differential-Algebraic Systems

This page was built for publication: Efficient matching in large DAE models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032907)