Minimal rank factorizations of polynomial matrices

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dmytryshyn, Andrii, Dopico, Froilán, Van Dooren, Paul
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909333154955264
author Dmytryshyn, Andrii
Dopico, Froilán
Van Dooren, Paul
author_facet Dmytryshyn, Andrii
Dopico, Froilán
Van Dooren, Paul
contents We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(λ)$ into products of three, $P(λ) = L(λ) E(λ) R(λ)$, or two, $P(λ) = L(λ) R(λ)$, polynomial matrices. Among all possible factorizations of these types, we focus on those for which $L(λ)$ and/or $R(λ)$ is a minimal basis, since they have favorable properties from the point of view of data compression and allow us to relate easily the degree of $P(λ)$ with some degree properties of the factors. We call these factorizations minimal rank factorizations. Motivated by the well-known fact that, generically, rank deficient polynomial matrices over the complex field do not have eigenvalues, we pay particular attention to the properties of the minimal rank factorizations of polynomial matrices without eigenvalues. We carefully analyze the degree properties of generic minimal rank factorizations in the set of complex $m \times n$ polynomial matrices with normal rank at most $r< \min \{m,n\}$ and degree at most $d$, and we prove that there are only $rd+1$ different classes of generic factorizations according to the degree properties of the factors and that all of them are of the form $L(λ) R(λ)$, where the degrees of the $r$ columns of $L(λ)$ differ at most by one, the degrees of the $r$ rows of $R(λ)$ differ at most by one, and, for each $i=1, \ldots, r$, the sum of the degrees of the $i$th column of $L(λ)$ and of the $i$th row of $R(λ)$ is equal to $d$. Finally, we show how these sets of polynomial matrices with generic factorizations are related to the sets of polynomial matrices with generic eigenstructures.
format Preprint
id arxiv_https___arxiv_org_abs_2312_00676
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Minimal rank factorizations of polynomial matrices
Dmytryshyn, Andrii
Dopico, Froilán
Van Dooren, Paul
Numerical Analysis
15A18, 15A22, 15A23, 15A54
We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(λ)$ into products of three, $P(λ) = L(λ) E(λ) R(λ)$, or two, $P(λ) = L(λ) R(λ)$, polynomial matrices. Among all possible factorizations of these types, we focus on those for which $L(λ)$ and/or $R(λ)$ is a minimal basis, since they have favorable properties from the point of view of data compression and allow us to relate easily the degree of $P(λ)$ with some degree properties of the factors. We call these factorizations minimal rank factorizations. Motivated by the well-known fact that, generically, rank deficient polynomial matrices over the complex field do not have eigenvalues, we pay particular attention to the properties of the minimal rank factorizations of polynomial matrices without eigenvalues. We carefully analyze the degree properties of generic minimal rank factorizations in the set of complex $m \times n$ polynomial matrices with normal rank at most $r< \min \{m,n\}$ and degree at most $d$, and we prove that there are only $rd+1$ different classes of generic factorizations according to the degree properties of the factors and that all of them are of the form $L(λ) R(λ)$, where the degrees of the $r$ columns of $L(λ)$ differ at most by one, the degrees of the $r$ rows of $R(λ)$ differ at most by one, and, for each $i=1, \ldots, r$, the sum of the degrees of the $i$th column of $L(λ)$ and of the $i$th row of $R(λ)$ is equal to $d$. Finally, we show how these sets of polynomial matrices with generic factorizations are related to the sets of polynomial matrices with generic eigenstructures.
title Minimal rank factorizations of polynomial matrices
topic Numerical Analysis
15A18, 15A22, 15A23, 15A54
url https://arxiv.org/abs/2312.00676