On the computation of the fundamental subspaces for descriptor systems
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear time-invariant descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are desc...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Taylor & Francis
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/37146 |
| _version_ | 1848754966488940544 |
|---|---|
| author | Kazantzidou, C. Ntogramatzidis, Lorenzo |
| author_facet | Kazantzidou, C. Ntogramatzidis, Lorenzo |
| author_sort | Kazantzidou, C. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear time-invariant descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation of supremal output-nulling subspaces and supremal output-nulling reachability subspaces for descriptor systems. |
| first_indexed | 2025-11-14T08:48:48Z |
| format | Journal Article |
| id | curtin-20.500.11937-37146 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:48:48Z |
| publishDate | 2016 |
| publisher | Taylor & Francis |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-371462017-09-13T15:34:03Z On the computation of the fundamental subspaces for descriptor systems Kazantzidou, C. Ntogramatzidis, Lorenzo In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear time-invariant descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation of supremal output-nulling subspaces and supremal output-nulling reachability subspaces for descriptor systems. 2016 Journal Article http://hdl.handle.net/20.500.11937/37146 10.1080/00207179.2015.1135510 Taylor & Francis fulltext |
| spellingShingle | Kazantzidou, C. Ntogramatzidis, Lorenzo On the computation of the fundamental subspaces for descriptor systems |
| title | On the computation of the fundamental subspaces for descriptor systems |
| title_full | On the computation of the fundamental subspaces for descriptor systems |
| title_fullStr | On the computation of the fundamental subspaces for descriptor systems |
| title_full_unstemmed | On the computation of the fundamental subspaces for descriptor systems |
| title_short | On the computation of the fundamental subspaces for descriptor systems |
| title_sort | on the computation of the fundamental subspaces for descriptor systems |
| url | http://hdl.handle.net/20.500.11937/37146 |