analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae
analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae
复制标题
DOI：
10.1007/978-3-642-34381-0_32
复制
发表时间：
2012-10
期刊：
影响因子：
--
通讯作者：
Yan Zeng;Xuesong Wu;Jianwen Cao
中科院分区：
文献类型：
--
作者：
Yan Zeng;Xuesong Wu;Jianwen Cao
随着社会的工业化，数学建模与仿真在产品设计中的作用越来越重要。目前，利用Modelica进行多领域统一建模是复杂系统领域的主流技术。使用Modelica对复杂的物理系统进行建模通常会产生高指数微分代数方程（DAE）系统。结构化索引约简算法是目前比较流行的索引约简方法之一。但在某些特殊情况下，其解可能是不正确的。目前，组合松弛算法是求解该问题的一种广泛使用的方法。求解最大加权匹配是组合松弛算法的重要问题之一。本文介绍了组合松弛算法，并提出了三种不同的实现匈牙利算法的最大加权匹配问题。理论计算结果与实验结果一致，
As the society industrialized, mathematical modeling and simulation become increasingly important in the product design. At present, the multi-domain unified modeling with Modelica is a mainstream technology in the field of complex systems. Modeling of complex physical systems with Modelica often produces a high-index differential algebraic equation (DAE) system. It needs to be transformed to low-index DAE before solving it. The structure index reduction algorithm is one of the popular index reduction methods. But in some special circumstances, its solution may be incorrect. At present, combinatorial relaxation algorithm is a widely used method for solving the problem. Solving maximum weighted matching is one of important problems of the combinatorial relaxation algorithm. This paper describes the combinatorial relaxation algorithm and proposes three different implementations of Hungarian algorithm for the maximum weighted matching problem. The theory results are consistent with the experiment results,