Generic pole assignability, structurally constrained controllers and unimodular completion
From MaRDI portal
Publication:2435587
Recommendations
Cites work
- A Matroid-Theoretic Approach to Structurally Fixed Modes of Control Systems
- A note on sign-solvability of linear system of equations
- A simple criterion for structurally fixed modes
- Algebraic characterization of fixed modes in decentralized control
- An algorithm for unimodular completion over Laurent polynomial rings
- Decentralized control of complex systems
- Fast projection methods for minimal design problems in linear system theory
- Finding all maximally-matchable edges in a bipartite graph
- Generic properties and control of linear structured systems: A survey
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- Introduction to algorithms
- Matching theory
- Matrices and matroids for systems analysis
- Multivariable Control
- On interconnections, control, and feedback
- On the Smith Normal Form of Structured Polynomial Matrices
- On the stabilization of decentralized control systems
- Refined Study on Structural Controllability of Descriptor Systems by Means of Matroids
- Structurally controllable and structurally canonical systems
- Structurally fixed modes
- The generic canonical form of a regular structured matrix pencil
- The generic dimension of a minimal realization of an AR system
Cited in
(3)
This page was built for publication: Generic pole assignability, structurally constrained controllers and unimodular completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435587)