Institutional Repository
| analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae | |
| Zeng Yan; Wu Xuesong; Cao Jianwen | |
| 2012 | |
| Conference Name | Asia Simulation Conference and the International Conference on System Simulation and Scientific Computing 2012, AsiaSim and ICSC 2012 |
| Source | Communications in Computer and Information Science |
| Pages | 277-286 |
| Conference Date | October 27, 2012 - October 30, 2012 |
| Conference Place | Shanghai, China |
| Indexed Type | EI |
| ISSN | 1865-0929 |
| ISBN | 9783642343803 |
| Department | (1) Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University Chinese Academy of Sciences Beijing 100049 China |
| English Abstract | 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. |
| Keyword | Algorithms Computer Simulation Models Problem Solving Product Design |
| Sponsorship | Chinese Association for System Simulation (CASS) |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15866 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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],2012:277-286. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment