2011
DOI: 10.1016/j.automatica.2010.10.038
|View full text |Cite
|
Sign up to set email alerts
|

An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems

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 Sylve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
30
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 39 publications
(30 citation statements)
references
References 7 publications
0
30
0
Order By: Relevance
“…Furthermore, this final step of projecting from descriptor to standard state space form can be performed efficiently via a numerical method (Schön et al 2003;Gerdin 2006;Shahzad et al 2011). This is summarised in Appendix B, and has been applied successfully to the problem of flow field estimation in a non-parallel boundary layer ).…”
Section: Dealing With Descriptor Systems: Eliminating the Incompressimentioning
confidence: 99%
“…Furthermore, this final step of projecting from descriptor to standard state space form can be performed efficiently via a numerical method (Schön et al 2003;Gerdin 2006;Shahzad et al 2011). This is summarised in Appendix B, and has been applied successfully to the problem of flow field estimation in a non-parallel boundary layer ).…”
Section: Dealing With Descriptor Systems: Eliminating the Incompressimentioning
confidence: 99%
“…The system (11) is an example of a descriptor state-space system (also known as a singular, implicit or generalised state-space system), the control and estimation of which are still an open research field. In this section an algorithm is summarised for converting (11) into a standard state-space system (Schön et al 2003, Gerdin 2006, Shahzad et al 2011.…”
Section: Dealing With Descriptor Systemsmentioning
confidence: 99%
“…The matrices in (13) are computed as follows (Gerdin 2006, Schön et al 2003, Shahzad et al 2011 (i) Compute the generalised Schur form of the matrix pencil λ E D − A D so that:…”
Section: 3) If the Pair (Ementioning
confidence: 99%
See 1 more Smart Citation
“…Many papers have presented different approaches for several matrix equations [7-9, 12-14, 17, 19, 20]. Especially, many problems in control theory can be transformed into the Sylvester matrix equations, such as singular system control [4,21], robust control [3,26], neural network [25,36]. The solvability of linear equations is a fundamental problem, and various results are developed, such as solvability conditions of linear equations for matrices over the complex field [1,2,10,11,18,22,23,[29][30][31][32][33][34]37], solvability conditions of linear equations over algebras or rings [5,6,24,27,28,35].…”
Section: Introductionmentioning
confidence: 99%