Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10398808 | Automatica | 2011 | 5 Pages |
Abstract
Descriptor systems consisting of a large number of differential-algebraic equations (DAEs) usually arise from the discretization of partial differential-algebraic equations. This paper presents an efficient algorithm for solving the coupled Sylvester equation that arises in converting a system of linear DAEs to ordinary differential equations. A significant computational advantage is obtained by exploiting the structure of the involved matrices. The proposed algorithm removes the need to solve a standard Sylvester equation or to invert a matrix. The improved performance of this new method over existing techniques is demonstrated by comparing the number of floating-point operations and via numerical examples.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Amir Shahzad, Bryn Ll. Jones, Eric C. Kerrigan, George A. Constantinides,