Pole-zero representation of descriptor systems

Document Type

Article

Publication Date

1-1-1995

Abstract

We present an algorithm for computing the pole-zero representation of descriptor systems whose generalized state-space models are described by the 5-tuple (E, A, b, c. d), where E may be a singular matrix but del (A - λE) ≠ 0. The proposed algorithm uses only-orthogonal transformations; hence the computed results are numerically reliable. Numerical examples are included to illustrate the proposed results. © 1995.

DOI

10.1016/0005-1098(94)00176-J

Find in your library

Off-Campus WSU Users


Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 10
see details

Share

COinS