Institutional Repository
| The Application of the Combinatorial Relaxation Theory on the Structural Index Reduction of DAE | |
| Wu, Xuesong; Zeng, Yan; Cao, Jianwen | |
| 2013 | |
| Conference Name | 12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES) |
| Pages | 162-166 |
| Conference Date | SEP 02-04, 2012 |
| Conference Place | London, ENGLAND |
| Indexed Type | CPCI |
| Publish Place | IEEE |
| ISBN | 978-0-7695-5060-2 |
| Department | [Wu, Xuesong; Zeng, Yan; Cao, Jianwen] Chinese Acad Sci, Inst Software, Lab Parallel Software & Computat Sci Software, Beijing 100190, Peoples R China. |
| English Abstract | 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. |
| Keyword | Complex System Modelica Dae Index Reduction Combinatorial Relaxation Theory |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16549 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Wu, Xuesong,Zeng, Yan,Cao, Jianwen. The Application of the Combinatorial Relaxation Theory on the Structural Index Reduction of DAE[C]. IEEE,2013:162-166. |
| 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