Existence of Reachable and Observable Triples of Linear Discrete-Time Descriptor Systems

Lazaros Moysis, Vikas Kumar Mishra

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


This work studies the reachability and observability of discrete-time descriptor systems and considers the following problem: Given a matrix pair (E, A), find a matrix B (C) such that the corresponding descriptor system is not reachable (observable). The computation of such a matrix can give us a set of conditions that can then be taken into account when constructing the matrix B (C) to make the system reachable (observable). The above problem is solved by working on the equivalent causal and noncausal subsystems that are obtained through the Weierstrass decomposition of discrete-time descriptor systems. Positive descriptor systems are also considered. The developed theory is illustrated through physical and numerical examples.

Original languageEnglish
Pages (from-to)1086-1098
Number of pages13
JournalCircuits, Systems, and Signal Processing
Issue number3
StatePublished - 15 Mar 2019
Externally publishedYes


  • Descriptor systems
  • Discrete-time systems
  • Linear systems
  • Observability
  • Positive descriptor systems
  • Reachability
  • Singular systems

ASJC Scopus subject areas

  • Signal Processing
  • Applied Mathematics


Dive into the research topics of 'Existence of Reachable and Observable Triples of Linear Discrete-Time Descriptor Systems'. Together they form a unique fingerprint.

Cite this