GMPCP for one row and one column completion
From MaRDI portal
Publication:5124679
Recommendations
- Completion of matrix pencils with a single rank restriction
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Combinatorics of column minimal indices and matrix pencil completion problems
- Matrix pencils completion problems. II
- The General Matrix Pencil Completion Problem: A Minimal Case
Cites work
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- 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
- Explicit solution of the row completion problem for matrix pencils
- Imbedding conditions for \(\lambda\)-matrices
- Interlacing inequalities for invariant factors
- Matrices with prescribed rows and invariant factors
- Matrices. Algebra, analysis and applications
- Matrix pencils completion problems
- Matrix pencils completion problems. II
- Similarity class of a matrix with a prescribed submatrix
- The General Matrix Pencil Completion Problem: A Minimal Case
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
This page was built for publication: GMPCP for one row and one column completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124679)