Froilan M. Dopico | Searcharxiv

arXiv2020

On minimal bases and indices of rational matrices and their linearizations

A complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations is presented. Such theory is based on establishing first the relationships between the minimal bases and indices of rational matrices and those of their polynomial system matrices under the classical minimality condition and certain additional conditions of properness. This is related to pioneer results obtained by Verghese, Van Dooren and Kailath in 1979-80, which were the first proving results of this type under different nonequivalent conditions. It is shown that the definitions of linearizations and strong linearizations do not guarantee any relationship between the minimal bases and indices of the linearizations and the rational matrices in general. In contrast, simple relationships are obtained for the family of strong block minimal bases linearizations, which can be used to compute minimal bases and indices of any rational matrix, including rectangular ones, via algorithms for pencils. These results extend the corresponding ones for other families of linearizations available in recent literature for square rational matrices.

math.NA↗

arXiv2017

Generic skew-symmetric matrix polynomials with fixed rank and fixed odd grade

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly described, complete eigenstructure. This complete eigenstructure corresponds to the most generic $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$ and rank at most $2r$. In particular, this result includes the case of skew-symmetric matrix pencils ($d=1$).

math.RA↗