The Application of the Combinatorial Relaxation Theory on the Structural Index Reduction of DAE
文献类型：会议论文
| 作者 | Wu, Xuesong ; Zeng, Yan ; Cao, Jianwen |
| 出版日期 | 2013 |
| 会议名称 | 12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES) |
| 会议日期 | SEP 02-04, 2012 |
| 会议地点 | London, ENGLAND |
| 关键词 | Complex system Modelica DAE Index reduction Combinatorial relaxation theory |
| 页码 | 162-166 |
| 中文摘要 | Multi-domain unified modeling is an important development direction in the study of complex system. Modelica is a popular multi-modeling language. It describes complex systems by mathematical equations, solves the high-index of Differential algebraic equations (DAE) generated by modeling. But in this process, the index reduction based on structural index, which is a key step of solving high-index DAE, will fail with small probability. Based on the combinatorial optimization theory, it analyzes the incorrect problem leaded by the index reduction algorithm for solving the DAE, gives the algorithm of detecting and correcting the incorrect of structural index reduction for matrix pencils. It implements the algorithm of detecting and correcting, and apply the algorithm into solving first-order linear time-invariant DAE system. The experiment result shows that for first-order linear time-invariant DAE, the problem about the failure of structural index reduction can be solved by the combinatorial optimization theory. |
| 英文摘要 | Multi-domain unified modeling is an important development direction in the study of complex system. Modelica is a popular multi-modeling language. It describes complex systems by mathematical equations, solves the high-index of Differential algebraic equations (DAE) generated by modeling. But in this process, the index reduction based on structural index, which is a key step of solving high-index DAE, will fail with small probability. Based on the combinatorial optimization theory, it analyzes the incorrect problem leaded by the index reduction algorithm for solving the DAE, gives the algorithm of detecting and correcting the incorrect of structural index reduction for matrix pencils. It implements the algorithm of detecting and correcting, and apply the algorithm into solving first-order linear time-invariant DAE system. The experiment result shows that for first-order linear time-invariant DAE, the problem about the failure of structural index reduction can be solved by the combinatorial optimization theory. |
| 收录类别 | CPCI |
| 会议录出版地 | IEEE |
| 语种 | 英语 |
| ISBN号 | 978-0-7695-5060-2 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16549]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Wu, Xuesong,Zeng, Yan,Cao, Jianwen. The Application of the Combinatorial Relaxation Theory on the Structural Index Reduction of DAE[C]. 见:12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES). London, ENGLAND. SEP 02-04, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。