Descriptor representations without direct feedthrough term

DOI10.1016/0005-1098(92)90190-QzbMath0766.93026MaRDI QIDQ1194992

S. Singh

Publication date: 20 October 1992

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

minimal realizationredundancydescriptor representations

Mathematics Subject Classification ID

Control/observation systems governed by ordinary differential equations (93C15)

Related Items (13)

Simultaneous state and input reachability for linear time invariant systems ⋮ A controllability test for general first-order representations ⋮ Geometric minimization under external equivalence for implicit descriptions ⋮ Canonical forms for descriptor systems under restricted system equivalence ⋮ Structural matrix minimization algorithm for implicit descriptions ⋮ Left invertibility and duality for linear systems ⋮ \({\mathcal H}_{\infty}\) optimal interconnections ⋮ Unnamed Item ⋮ Algebraic aspects of controllability for AR-systems ⋮ On behavior homomorphisms and system equivalence ⋮ Unnamed Item ⋮ Full information and full control in a behavioral setting ⋮ A study of behaviors

Cites Work

• From time series to linear system. I: Finite dimensional linear time invariant systems
• Generalized state space realizations of non-proper rational transfer functions
• Minimality of descriptor representations under external equivalence
• Input-output and state-space representations of finite-dimensional linear time-invariant systems
• A generalized state-space for singular systems
• Boundary-value descriptor systems: well-posedness, reachability and observability
• The structure of nonsingular polynomial matrices
• Structural properties of linear dynamical systems
• Realization of Autoregressive Equations in Pencil and Descriptor Form

This page was built for publication: Descriptor representations without direct feedthrough term