analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae
文献类型：会议论文
| 作者 | Zeng Yan ; Wu Xuesong ; Cao Jianwen |
| 出版日期 | 2012 |
| 会议名称 | Asia Simulation Conference and the International Conference on System Simulation and Scientific Computing 2012, AsiaSim and ICSC 2012 |
| 会议日期 | October 27, 2012 - October 30, 2012 |
| 会议地点 | Shanghai, China |
| 关键词 | Algorithms Computer simulation Models Problem solving Product design |
| 页码 | 277-286 |
| 中文摘要 | 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. © 2012 Springer-Verlag. |
| 英文摘要 | 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. © 2012 Springer-Verlag. |
| 收录类别 | EI |
| 会议主办者 | Chinese Association for System Simulation (CASS) |
| 会议录 | Communications in Computer and Information Science
 |
| 语种 | 英语 |
| ISSN号 | 1865-0929 |
| ISBN号 | 9783642343803 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15866]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Zeng Yan,Wu Xuesong,Cao Jianwen. analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae[C]. 见:Asia Simulation Conference and the International Conference on System Simulation and Scientific Computing 2012, AsiaSim and ICSC 2012. Shanghai, China. October 27, 2012 - October 30, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。