The General Matrix Pencil Completion Problem: A Minimal Case

DOI10.1137/17M1155041zbMath1414.15033OpenAlexW2923056950WikidataQ128209663 ScholiaQ128209663MaRDI QIDQ4631264

Marko Stošić, Marija Dodig

Publication date: 24 April 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1155041

zbMATH Keywords

completion of matrix pencilsmajorization of partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Matrix pencils (15A22) Matrix completion problems (15A83)

Related Items (8)

Completion of matrix pencils with a single rank restriction ⋮ Unnamed Item ⋮ Combinatorics of polynomial chains ⋮ Bounded rank perturbations of a regular matrix pencil ⋮ Row or Column Completion of Polynomial Matrices of Given Degree ⋮ Rank-one perturbations of matrix pencils ⋮ Unnamed Item ⋮ Rank One Perturbations of Matrix Pencils

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of quasi-regular matrix pencils
• Subrepresentations of Kronecker representations.
• Explicit solution of the row completion problem for matrix pencils
• Matrix pencils completion problems. II
• Matrices with prescribed rows and invariant factors
• Fundamental theorem of state feedback for singular systems
• Interlacing inequalities for regular pencils
• Embedding a regular subpencil into a general linear pencil
• Similarity invariants of completions of submatrices
• Interlacing inequalities for invariant factors
• Imbedding conditions for \(\lambda\)-matrices
• Assigning the Kronecker invariants of a matrix pencil by row or column completions
• Submodules of Kronecker modules via extension monoid products
• Placing zeroes and the Kronecker canonical form
• Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Combinatorics of polynomial chains
• The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
• Minimal completion problem for quasi-regular matrix pencils
• Matrix pencils completion problems
• Feedback invariants of matrices with prescribed rows
• Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
• Combinatorics of Column Minimal Indices and Matrix Pencil Completion Problems
• Column completion of a pair of matrices
• Eigenvalues of completions of submatrices
• Similarity class of a matrix with a prescribed submatrix
• Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
• Controllability Subspaces and Feedback Simulation
• On the fundamental theorem of linear state variable feedback
• Eigenvalues, invariant factors, highest weights, and Schubert calculus
• Descriptor Systems Under Feedback and Output Injection

This page was built for publication: The General Matrix Pencil Completion Problem: A Minimal Case