Equivalences for Linearizations of Matrix Polynomials

arXiv2102.09726MaRDI QIDQ6361012FDOQ6361012

Authors: Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders 

Publication date: 18 February 2021

Abstract: One useful standard method to compute eigenvalues of matrix polynomials $$ of degree at most $ell$ in $z$ (denoted of grade $ell$, for short) is to first transform $$ to an equivalent linear matrix polynomial $$, called a companion pencil, where $$ and $$ are usually of larger dimension than $$ but $$ is now only of grade $1$ in $z$. The eigenvalues and eigenvectors of $$ can be computed numerically by, for instance, the QZ algorithm. The eigenvectors of $$, including those for infinite eigenvalues, can also be recovered from eigenvectors of $$ if $$ is what is called a "strong linearization" of $$. In this paper we show how to use algorithms for computing the Hermite Normal Form of a companion matrix for a scalar polynomial to direct the discovery of unimodular matrix polynomial cofactors $$ and $$ which, via the equation $$, explicitly show the equivalence of $$ and $$. By this method we give new explicit constructions for several linearizations using different polynomial bases. We contrast these new unimodular pairs with those constructed by strict equivalence, some of which are also new to this paper. We discuss the limitations of this experimental, computational discovery method of finding unimodular cofactors.

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical interpolation (65D05) Matrix pencils (15A22)

This page was built for publication: Equivalences for Linearizations of Matrix Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6361012)