The standard way of solving the polynomial eigenvalue problem associated with a matrix
polynomial is to embed the matrix coefficients of the polynomial into a matrix pencil …

We prove that we can always construct strongly minimal linearizations of an arbitrary rational
matrix from its Laurent expansion around the point at infinity, which happens to be the case …

We start by introducing a new class of structured matrix polynomials, namely, the class of
$\mathbf {M} _A $-structured matrix polynomials, to provide a common framework for many …

In this paper, we introduce a new family of equations for matrix pencils that may be utilized
for the construction of strong linearizations for any square or rectangular matrix polynomial …

The main objects of study in this PhD thesis are rational matrices. A rational matrix R (z) is a
matrix whose entries are quotients of polynomials in the scalar variable z, ie, rational …

Polynomials eigenvalue problems with structured matrix polynomials arise in many
applications. The standard way to solve polynomial eigenvalue problems is through the …

The standard way of solving the polynomial eigenvalue problem associated with a matrix
polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem …