Abstract
Algebraic criteria have been developed to check the complete and strong controllability for rectangular descriptor systems. Under the assumption of controllability at infinity, the complete controllability for a descriptor system has been proved to be equivalent to the controllability for a normal system. The essence of the technique to design the proposed normal system is based on the row and column compression operations of basic matrix theory. The strong controllability concept for a descriptor system is related with the complete controllability concept for another descriptor system. Examples are provided to illustrate the theory.
| Original language | English |
|---|---|
| Pages (from-to) | 1395-1406 |
| Number of pages | 12 |
| Journal | Circuits, Systems, and Signal Processing |
| Volume | 35 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Apr 2016 |
| Externally published | Yes |
Keywords
- Controllability
- Descriptor systems
- Singular value decomposition
ASJC Scopus subject areas
- Signal Processing
- Applied Mathematics