The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
From MaRDI portal
Publication:2250776
Recommendations
Cites work
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 921465 (Why is no real title available?)
- scientific article; zbMATH DE number 3343633 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Column completion of a pair of matrices
- Combinatorics of column minimal indices and matrix pencil completion problems
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Embedding a regular subpencil into a general linear pencil
- Explicit solution of the row completion problem for matrix pencils
- Feedback invariants of matrices with prescribed rows
- Feedback invariants of restrictions -- a polynomial approach
- Invariant Factors Under Rank One Perturbations
- Low Rank Perturbation of Jordan Structure
- Low Rank Perturbation of Kronecker Structures without Full Rank
- Low Rank Perturbation of Weierstrass Structure
- Low rank perturbation of regular matrix polynomials
- Matrix pencils completion problems
- Matrix pencils completion problems. II
- On convexity of polynomial paths and generalized majorizations
- On properties of the generalized majorization
- Pole Assignment and Additive Perturbations of Fixed Rank
- Rank distance problem for pairs of matrices
- Similarity class of a matrix with a prescribed submatrix
- Stratification of controllability and observability pairs-theory and use in applications
- Sur la réduction canonique des couples de matrices
- The algebraic structure of pencils and block Toeplitz matrices
- The change of feedback invariants under one row perturbation
- The rank of the difference of matrices with prescribed invariant factors
- The rank of the difference of matrices with prescribed similarity classes
- Unified theorems on completions of matrix pencils
Cited in
(16)- The change of feedback invariants under one row perturbation
- Bounded rank perturbations of regular pencils over arbitrary fields
- Completion of quasi-regular matrix pencils
- Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
- Fixed rank perturbations of regular matrix pencils
- Feedback invariants of a pair of matrices with prescribed columns
- GMPCP for one row and one column completion
- Completion of matrix pencils with a single rank restriction
- Descriptor systems under feedback and output injection
- Weierstrass structure and eigenvalue placement of regular matrix pencils under low rank perturbations
- Rank one perturbations of matrix pencils
- The General Matrix Pencil Completion Problem: A Minimal Case
- Bounded rank perturbations of a regular matrix pencil
- Rank-one perturbations of matrix pencils
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- Rank distance problem for pairs of matrices
This page was built for publication: The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250776)