A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system

DOI10.1080/00207179608921727zbMath0867.93023OpenAlexW2166003566MaRDI QIDQ5688052

Jacob W. van der Woude

Publication date: 11 August 1997

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179608921727

zbMATH Keywords

algorithmkernel representationstructured systemcontrolled invariant subspace

Mathematics Subject Classification ID

Applications of graph theory (05C90) Geometric methods (93B27) Linear systems in control theory (93C05)

Related Items (1)

Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder

Cites Work

• Unnamed Item
• Transformations of linear systems under external equivalence
• Decoupling of structured systems
• A graph-theoretic characterization for the rank of the transfer matrix of structured system
• A geometric approach for structured systems: Application to disturbance decoupling
• Structural invertibility of transfer functions
• New decoupling invariants: the essential orders
• A precompensator of minimal order for decoupling a linear multi-variable system†

This page was built for publication: A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system