Institutional Repository
| the research and analysis of hungarian algorithm in the structure index reduction for dae | |
| Zeng Yan; Wu Xuesong; Cao Jianwen | |
| 2012 | |
| Conference Name | 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012 |
| Source | Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012 |
| Pages | 446-450 |
| Conference Date | October 19, 2012 - October 22, 2012 |
| Conference Place | Guilin, China |
| Indexed Type | EI |
| ISBN | 9780769548180 |
| 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 | Modeling of complex physical systems with Modelica usually leads to the high-index differential algebraic equation system (DAE), index reduction is an important part of solving the high-index DAE. The structure index reduction algorithm is one of the popular methods, but in special cases, it fails. Combinatorial relaxation algorithm can detect and correct the breakdown situation. And the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation algorithm. In order to choose the proper method for the large-scale, dense bipartite graph, this paper provides three implementations of the Hungarian algorithm. The experiment results and the theory show that the BFS single-augmented method is better than others. © 2012 IEEE.; Modeling of complex physical systems with Modelica usually leads to the high-index differential algebraic equation system (DAE), index reduction is an important part of solving the high-index DAE. The structure index reduction algorithm is one of the popular methods, but in special cases, it fails. Combinatorial relaxation algorithm can detect and correct the breakdown situation. And the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation algorithm. In order to choose the proper method for the large-scale, dense bipartite graph, this paper provides three implementations of the Hungarian algorithm. The experiment results and the theory show that the BFS single-augmented method is better than others. © 2012 IEEE. |
| Keyword | Algorithms Models |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15887 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zeng Yan,Wu Xuesong,Cao Jianwen. the research and analysis of hungarian algorithm in the structure index reduction for dae[C],2012:446-450. |
| 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