Algorithms to verify generic causality and controllability of descriptor systems

DOI10.1109/TAC.1985.1104069MaRDI QIDQ3690672zbMATH OpenFDO

Authors Takeo Yamada, David G. Luenberger

Publication date 1985

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1985.1104069

zbMATH Keywords

generic causalitygeneric controllabilityGraph-theoretic algorithmsstructured descriptor systems

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) General theory for ordinary differential equations (34A99) Graph theory (including graph drawing) in computer science (68R10) Controllability (93B05) Algebraic methods (93B25) Linear systems in control theory (93C05)

Recommendations

• Generic controllability theorems for descriptor systems
• Digraph characterization of structural controllability for linear descriptor systems
• scientific article; zbMATH DE number 1497169
• Refined Study on Structural Controllability of Descriptor Systems by Means of Matroids
• Graph-theoretic approach to symbolic analysis of linear descriptor systems

Cited in

(5)

• A tutorial on the geometric analysis of linear time-invariant implicit systems
• Graph-theoretic approach to symbolic analysis of linear descriptor systems
• On the generic controllability of continuous generalized state-space systems
• On the causality of linear time invariant descriptor systems
• G-cactus and new results on structural controllability of composite systems

This page was built for publication: Algorithms to verify generic causality and controllability of descriptor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690672)