Rank distance problem for pairs of matrices

DOI10.1080/03081087.2012.670237zbMath1266.15039OpenAlexW2091119131MaRDI QIDQ4908170

Marija Dodig

Publication date: 4 March 2013

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

feedback equivalencematrix paircompletion of matriceslow rank perturbationscontrollable pair of matricesrank distance problem

Mathematics Subject Classification ID

Controllability (93B05) Feedback control (93B52) Perturbations in control/observation systems (93C73) Matrix completion problems (15A83)

Related Items

Completion of quasi-regular matrix pencils ⋮ The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils

Cites Work

• Explicit solution of the row completion problem for matrix pencils
• Low rank perturbation of regular matrix polynomials
• Matrices with prescribed rows and invariant factors
• On the characteristic polynomial of matrices with prescribed rows
• Feedback invariants of matrices with prescribed rows
• Combinatorics of Column Minimal Indices and Matrix Pencil Completion Problems
• The rank of the difference of matrices with prescribed similarity classes
• The rank of the difference of matrices with prescribed invariant factors
• Invariant Factors Under Rank One Perturbations
• Pole Assignment and Additive Perturbations of Fixed Rank