The Generic Number of Invariant Zeros of a Structured Linear System
From MaRDI portal
Publication:4943709
DOI10.1137/S0363012996310119zbMath0952.93056MaRDI QIDQ4943709
Publication date: 19 March 2000
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Applications of graph theory (05C90) Linear systems in control theory (93C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrix pencils (15A22)
Related Items
A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems, State and input observability for structured linear systems: A graph-theoretic approach, Security index based on perfectly undetectable attacks: graph-theoretic conditions, State and input observability of multi-agent systems: a necessary and sufficient condition, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, Generic properties and control of linear structured systems: A survey, Observability of switching structured linear systems with unknown input. A graph-theoretic approach, Block sparse design of distributed controllers for dynamical network systems, Sensor location for discrete mode observability of switching linear systems with unknown inputs, Structural analysis for the sensor location problem in fault detection and isolation, System theory for system identification., Partial state observability recovering for linear systems by additional sensor implementation, Structural analysis of the partial state and input observability for structured linear systems: application to distributed systems, A graph-theoretic approach to fault detection and isolation for structured bilinear systems, Observability analysis for structured bilinear systems: a graph-theoretic approach, State and input observability recovering by additional sensor implementation: a graph-theoretic approach, Unnamed Item, Generic uniform observability analysis for bilinear systems, A graph theoretical approach to the parameters identifiability characterisation, A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system