Row or Column Completion of Polynomial Matrices of Given Degree

DOI10.1137/23M1564547MaRDI QIDQ6154952zbMATH OpenOpenAlexFDO

Authors A. Amparan, Itziar Baragaña, S. Marcaida, A. Roca

Publication date 16 February 2024

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

Full work available at URL https://arxiv.org/abs/2306.06104

zbMATH Keywords

eigenstructurematrix polynomialscompletion

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Matrix completion problems (15A83) Canonical forms, reductions, classification (15A21)

Abstract: We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column) completion problem of a polynomial matrix of given degree under different prescribed invariants: the whole eigenstructure, all of it but the row (column) minimal indices, and the finite and/or infinite structures. Moreover, we characterize the existence of a polynomial matrix with prescribed degree and eigenstructure over an arbitrary field.

Recommendations

• Matrix completion problems
• Matrix polynomials with completely prescribed eigenstructure
• scientific article; zbMATH DE number 523915
• A note on ``Constructing matrices with prescribed off-diagonal submatrix and invariant polynomials

Cites work

• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 49560 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 3220353 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• Assigning the Kronecker invariants of a matrix pencil by row or column completions
• Column completion of a pair of matrices
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Eigenvalues of completions of submatrices
• Embedding a regular subpencil into a general linear pencil
• Existence of matrices with prescribed eigenvalues and entries
• Explicit solution of the row completion problem for matrix pencils
• Feedback invariants of matrices with prescribed rows
• Imbedding conditions for \(\lambda\)-matrices
• Interlacing inequalities and control theory
• Interlacing inequalities for invariant factors
• Interlacing inequalities for regular pencils
• Matrices with Prescribed Characteristic Polynomials
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• Matrices with Prescribed Entries and Characteristic Polynomial
• Matrices with prescribed characteristic polynomials and a prescribed submatrix. I, II
• Matrices with prescribed eigenvalues and principal submatrices
• Matrices with prescribed rows and invariant factors
• Matrices. Algebra, analysis and applications
• Matrix Polynomials
• Matrix pencils completion problems
• Matrix polynomials with completely prescribed eigenstructure
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• NLEVP, a collection of nonlinear eigenvalue problems
• On convexity of polynomial paths and generalized majorizations
• Placing zeroes and the Kronecker canonical form
• Similarity class of a matrix with a prescribed submatrix
• Similarity invariants of completions of submatrices
• Spectral equivalence of matrix polynomials and the index sum theorem
• The General Matrix Pencil Completion Problem: A Minimal Case
• The quadratic eigenvalue problem
• Unified theorems on completions of matrix pencils

This page was built for publication: Row or Column Completion of Polynomial Matrices of Given Degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154952)