In this section
@article{Shahzad:2011:10.1016/j.automatica.2010.10.038,
author = {Shahzad, A and Jones, BL and Kerrigan, EC and Constantinides, GA},
doi = {10.1016/j.automatica.2010.10.038},
journal = {Automatica},
pages = {244--248},
title = {An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems},
url = {http://dx.doi.org/10.1016/j.automatica.2010.10.038},
volume = {47},
year = {2011}
}
TY - JOUR
AB - 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.
AU - Shahzad,A
AU - Jones,BL
AU - Kerrigan,EC
AU - Constantinides,GA
DO - 10.1016/j.automatica.2010.10.038
EP - 248
PY - 2011///
SN - 1873-2836
SP - 244
TI - An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems
T2 - Automatica
UR - http://dx.doi.org/10.1016/j.automatica.2010.10.038
UR - http://cas.ee.ic.ac.uk/people/gac1/pubs/AmirAutomatica10.pdf
UR - http://hdl.handle.net/10044/1/26453
VL - 47
ER -