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 |