Explicit solution of the row completion problem for matrix pencils

DOI10.1016/J.LAA.2009.10.039MaRDI QIDQ847217zbMATH OpenOpenAlexFDO

Authors Marija Dodig

Publication date 12 February 2010

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2009.10.039

zbMATH Keywords

completionKronecker invariantsmatrix pencils

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrix pencils (15A22) Matrix completion problems (15A83)

Review text

Necessary and sufficient conditions are provided for the existence of a matrix pencil whose strict equivalence (Kronecker) invariants and some of its rows (or columns) are prescribed. This result improves the conditions contained in a previous author's paper, by giving new and explicit necessary and sufficient conditions.

Recommendations

• Matrix pencils completion problems
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Matrix pencils completion problems. II
• Pencils with prescribed constant subpencils
• The General Matrix Pencil Completion Problem: A Minimal Case

Cites work

• Assigning the Kronecker invariants of a matrix pencil by row or column completions
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• 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

(22)

• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Bounded rank perturbations of regular pencils over arbitrary fields
• 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
• Matrix pencils completion problems
• Completion of quasi-regular matrix pencils
• scientific article; zbMATH DE number 7224104 (Why is no real title available?)
• Pencils with prescribed constant subpencils
• The General Matrix Pencil Completion Problem: A Minimal Case
• Rank distance problem for pairs of matrices
• A short solution to the subpencil problem involving only column minimal indices
• GMPCP for one row and one column completion
• Some remarks on matrix pencil completion problems.
• Rank one perturbations of matrix pencils
• Completion of matrix pencils with a single rank restriction
• Row or Column Completion of Polynomial Matrices of Given Degree
• Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
• Is the bounded rank perturbations problem for matrix pencils just a completion problem?
• Bounded rank perturbations of matrix pencils without nontrivial invariant factors
• Minimal rank perturbations of matrix pencils
• Matrix pencils completion problems. II

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)