On Complete and Strong Controllability for Rectangular Descriptor Systems

Vikas Kumar Mishra, Nutan Kumar Tomar

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


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 languageEnglish
Pages (from-to)1395-1406
Number of pages12
JournalCircuits, Systems, and Signal Processing
Issue number4
StatePublished - 1 Apr 2016
Externally publishedYes


  • Controllability
  • Descriptor systems
  • Singular value decomposition

ASJC Scopus subject areas

  • Signal Processing
  • Applied Mathematics


Dive into the research topics of 'On Complete and Strong Controllability for Rectangular Descriptor Systems'. Together they form a unique fingerprint.

Cite this