Row or Column Completion of Polynomial Matrices of Given Degree

DOI10.1137/23M1564547arXiv2306.06104OpenAlexW4391605219MaRDI QIDQ6154952FDOQ6154952

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)

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.

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

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

zbMATH Keywords

eigenstructurematrix polynomialscompletion

Mathematics Subject Classification ID

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

Cites Work

• NLEVP, a collection of nonlinear eigenvalue problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Title not available (Why is that?)
• Matrices with prescribed rows and invariant factors
• Interlacing inequalities for regular pencils
• Embedding a regular subpencil into a general linear pencil
• Unified theorems on completions of matrix pencils
• 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
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Matrix pencils completion problems
• Feedback invariants of matrices with prescribed rows
• The quadratic eigenvalue problem
• Column completion of a pair of matrices
• Eigenvalues of completions of submatrices
• Similarity class of a matrix with a prescribed submatrix
• Spectral equivalence of matrix polynomials and the index sum theorem
• Explicit solution of the row completion problem for matrix pencils
• On convexity of polynomial paths and generalized majorizations
• Matrix Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• Matrix polynomials with completely prescribed eigenstructure
• Matrices with Prescribed Characteristic Polynomials
• Interlacing inequalities and control theory
• Existence of matrices with prescribed eigenvalues and entries
• Matrices with prescribed eigenvalues and principal submatrices
• Matrices with Prescribed Entries and Characteristic Polynomial
• Matrices with prescribed characteristic polynomials and a prescribed submatrix. I, II
• Matrices. Algebra, analysis and applications
• Placing zeroes and the Kronecker canonical form
• The General Matrix Pencil Completion Problem: A Minimal Case

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)