组合松弛算法的研究与分析  

Research and analysis of combinatorial relaxation algorithm

作　　者：张薇[1,2] 饶锴[1,2] 曹建文[1] 

机构地区：[1]中国科学院软件研究所并行软件和计算科学实验室,北京100190 [2]中国科学院研究生院,北京100049

出　　处：《计算机工程与设计》2011年第2期554-559,563,共7页Computer Engineering and Design

基　　金：国家自然科学基金委员会-中国工程物理研究院"NSAF"联合基金项目(10776035);国家973重点基础研究发展计划基金项目(G2005CB321702)

摘　　要：基于Modelica语言的仿真建模往往得到的数学模型是高指标的微分代数系统,结构指标约简算法是约简此类高指标问题的一种快速算法。为了解决算法少数情况下的失效问题,深入研究和分析了一种修正算法——组合松弛算法。针对线性时不变系统设计并实现了该算法,并通过两个具体实例表明了组合松弛算法能够有效地检测并修正结构指标约简算法的失效问题。Modelica language based modeling and simulation usually gets a mathematical model which is a high-indexed differentialalgebraic equation system. The structural index reduction algorithms can serve as a fast method to reduce such high-indexed issues. In order to solve the failure of the structural index reduction algorithms in a few cases, another algorithm which is called combinatorial relaxation algorithm is analyzed and studied. Then, the algorithm is verified by a linear time-invariant system modeling process with two examples presented, respectively. Finally, the result of these two examples shows the correction algorithm presented is an effective way to detect and correct the application of structural index reduction algorithms.

关 键 词：微分代数方程 指标约简 微分指标 结构指标 组合松弛算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]