中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
the research and analysis of hungarian algorithm in the structure index reduction for dae
Author: Zeng Yan ; Wu Xuesong ; Cao Jianwen
Source: Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
Conference Name: 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
Conference Date: October 19, 2012 - October 22, 2012
Issued Date: 2012
Conference Place: Guilin, China
Keyword: Algorithms ; Models
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
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.
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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15887
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zeng Yan,Wu Xuesong,Cao Jianwen. the research and analysis of hungarian algorithm in the structure index reduction for dae[C]. 见:11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012. Guilin, China. October 19, 2012 - October 22, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zeng Yan]'s Articles
[Wu Xuesong]'s Articles
[Cao Jianwen]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zeng Yan]‘s Articles
[Wu Xuesong]‘s Articles
[Cao Jianwen]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace