Completion of quasi-regular matrix pencils
From MaRDI portal
Publication:273138
DOI10.1016/j.laa.2016.03.020zbMath1334.15068OpenAlexW2306362598MaRDI QIDQ273138
Publication date: 21 April 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.020
Combinatorial aspects of partitions of integers (05A17) Matrix pencils (15A22) Matrix completion problems (15A83)
Related Items
Completion of matrix pencils with a single rank restriction, Unnamed Item, Minimal completion problem for quasi-regular matrix pencils, Combinatorics of polynomial chains, The General Matrix Pencil Completion Problem: A Minimal Case, Descriptor Systems Under Feedback and Output Injection, Double generalized majorization and diagrammatics
Cites Work
- Subrepresentations of Kronecker representations.
- Explicit solution of the row completion problem for matrix pencils
- Matrix pencils completion problems. II
- On convexity of polynomial paths and generalized majorizations
- Matrices with prescribed rows and invariant factors
- Interlacing inequalities for regular pencils
- Embedding a regular subpencil into a general linear pencil
- Unified theorems on completions of matrix pencils
- Similarity invariants of completions of submatrices
- Interlacing inequalities for invariant factors
- Imbedding conditions for \(\lambda\)-matrices
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
- Matrix pencils completion problems
- Feedback invariants of matrices with prescribed rows
- Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
- Combinatorics of Column Minimal Indices and Matrix Pencil Completion Problems
- Column completion of a pair of matrices
- Eigenvalues of completions of submatrices
- Similarity class of a matrix with a prescribed submatrix
- Rank distance problem for pairs of matrices
- On properties of the generalized majorization