Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generic matrix polynomials with fixed rank and fixed degree

Published 13 Dec 2016 in math.NA | (1612.04085v1)

Abstract: The set ${\cal P}{m\times n}{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min {m, n}-1$, we show that ${\cal P}{m\times n}{r,d}$ is the union of the closures of the $rd+1$ sets of matrix polynomials with rank $r$, degree exactly $d$, and explicitly described complete eigenstructures. In addition, for the full-rank rectangular polynomials, i.e. $r= \min {m, n}$ and $m \neq n$, we show that ${\cal P}{m\times n}_{r,d}$ coincides with the closure of a single set of the polynomials with rank $r$, degree exactly $d$, and the described complete eigenstructure. These complete eigenstructures correspond to generic $m \times n$ matrix polynomials of grade $d$ and rank at most~$r$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.