Explicit solution of the row completion problem for matrix pencils
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Matrix pencils completion problems
- Matrix pencils completion problems. II
- On convexity of polynomial paths and generalized majorizations
- Similarity class of a matrix with a prescribed submatrix
Cited in
(19)- Rank distance problem for pairs of matrices
- Completion of quasi-regular matrix pencils
- The General Matrix Pencil Completion Problem: A Minimal Case
- Pencils with prescribed constant subpencils
- Row or Column Completion of Polynomial Matrices of Given Degree
- Completion of matrix pencils with a single rank restriction
- Matrix pencils completion problems. II
- Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
- Some remarks on matrix pencil completion problems.
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
- Pencils with prescribed constant subpencils over arbitrary fields
- Minimal completion problem for quasi-regular matrix pencils
- Matrix pencils completion problems
- GMPCP for one row and one column completion
- Rank one perturbations of matrix pencils
- Bounded rank perturbations of regular pencils over arbitrary fields
- A short solution to the subpencil problem involving only column minimal indices
This page was built for publication: Explicit solution of the row completion problem for matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847217)