Combinatorics of column minimal indices and matrix pencil completion problems
From MaRDI portal
Recommendations
Cited in
(25)- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Double generalized majorization
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
- Minimal completion problem for quasi-regular matrix pencils
- Pencils with prescribed constant subpencils over arbitrary fields
- Completion of quasi-regular matrix pencils
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- The General Matrix Pencil Completion Problem: A Minimal Case
- On the combinatorics of extensions of preinjective Kronecker modules.
- Rank distance problem for pairs of matrices
- Descriptor systems under feedback and output injection
- A short solution to the subpencil problem involving only column minimal indices
- GMPCP for one row and one column completion
- Combinatorial Analysis of Singular Matrix Pencils
- Rank one perturbations of matrix pencils
- Double generalized majorization and diagrammatics
- Completion of matrix pencils with a single rank restriction
- Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
- Matrix pencils completions of size two
- Is the bounded rank perturbations problem for matrix pencils just a completion problem?
- Legendre duality in combinatorial study of matrix pencils
- Bounded rank perturbations of matrix pencils without nontrivial invariant factors
- Minimal rank perturbations of matrix pencils
This page was built for publication: Combinatorics of column minimal indices and matrix pencil completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079748)