Application of the combinatorial relaxation algorithm in index reduction method
- Resource Type
- Conference
- Authors
- Yan, Yongxin; Zhang, Xiaolei
- Source
- 2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC) Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on. :1618-1622 Aug, 2011
- Subject
- Robotics and Control Systems
Power, Energy and Industry Applications
Signal Processing and Analysis
Transportation
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Indexes
Mathematical model
Algorithm design and analysis
Object oriented modeling
Numerical models
Biological system modeling
Equations
differential-algebraic equation
index reduction
combinatorial relaxation algorithm
maximum weighted matching
matrix rank
- Language
The mathematical modeling and simulation usually gets a high-index differential-algebraic equation (DAE) system. The structural index reduction algorithms can reduce high-index DAE to low-index DAE. In order to solve the failure of the structural index reduction algorithms in some cases, the authors firstly analyze the combinatorial relaxation algorithm. Then some key algorithms in the implementation of the combinatorial relaxation algorithm are analyzed. Finally, the result of an example shows that the combinatorial relaxation algorithm is an effective way to improve the stability and suitability of the index reduction algorithm based on structural index in DAE.