Controllability of pairs of matrices with prescribed entries

DOI10.1016/j.mcm.2011.05.050zbMath1235.93043OpenAlexW2065972228MaRDI QIDQ409921

Glória Cravo

Publication date: 15 April 2012

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.05.050

zbMATH Keywords

controllabilitycharacteristic polynomialsmatrix completion problems

Mathematics Subject Classification ID

Controllability (93B05) Linear systems in control theory (93C05) Matrix pencils (15A22) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix completion problems
• Systems analysis by graphs and matroids. Structural solvability and controllability
• Fast projection methods for minimal design problems in linear system theory
• Interlacing inequalities for invariant factors
• Imbedding conditions for \(\lambda\)-matrices
• On the number of invariant factors of partially prescribed matrices and control theory
• Controllability by completions of partial upper triangular matrices
• Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
• Matrices with prescribed submatrices and number of invariant polynomials
• Matrix Analysis
• On structural controllability theorem
• Structural controllability of multiinput linear systems
• Structural controllability
• On controllability of partially prescribed matrices
• Characteristic polynomials and controllability of partially prescribed matrices

This page was built for publication: Controllability of pairs of matrices with prescribed entries