analysis and implementation for the algorithm based on combinatorial relaxation for computing the structure index of dae

ISCAS OpenIR

	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
会议录名称	Communications in Computer and Information Science
页码	277-286
会议日期	October 27, 2012 - October 30, 2012
会议地点	Shanghai, China
收录类别	EI
ISSN	1865-0929
ISBN	9783642343803
部门归属	(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
摘要	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.
关键词	Algorithms Computer Simulation Models Problem Solving Product Design
主办者	Chinese Association for System Simulation (CASS)
语种	英语
内容类型	会议论文
URI标识	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],2012:277-286.