GMPCP for one row and one column completion
From MaRDI portal
Publication:5124679
zbMATH Open1448.15036MaRDI QIDQ5124679FDOQ5124679
Authors: Marija Dodig, Marko Stošić 
Publication date: 30 September 2020
Full work available at URL: https://journals.uwyo.edu/index.php/ela/article/view/5203
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
- Matrices with prescribed rows and invariant factors
- 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
- Combinatorics of column minimal indices and matrix pencil completion problems
- Similarity class of a matrix with a prescribed submatrix
- Explicit solution of the row completion problem for matrix pencils
- Matrix pencils completion problems. II
- Matrices. Algebra, analysis and applications
- Title not available (Why is that?)
- The General Matrix Pencil Completion Problem: A Minimal Case
Cited In (1)
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)
