NANAMay 29, 2018

Algebraic Linearizations of Matrix Polynomials

arXiv:1805.1158012 citationsh-index: 33
Originality Synthesis-oriented
AI Analysis

This provides a systematic algebraic approach to linearizing matrix polynomials, which is useful for numerical linear algebra and polynomial eigenvalue problems.

The paper presents a method to construct linearizations of matrix polynomials from linearizations of their component polynomials, enabling a new companion matrix construction for matrix polynomials.

We show how to construct linearizations of matrix polynomials $z\mathbf{a}(z)\mathbf{d}_0 + \mathbf{c}_0$, $\mathbf{a}(z)\mathbf{b}(z)$, $\mathbf{a}(z) + \mathbf{b}(z)$ (when $\mathrm{deg}\left(\mathbf{b}(z)\right) < \mathrm{deg}\left(\mathbf{a}(z)\right)$), and $z\mathbf{a}(z)\mathbf{d}_0\mathbf{b}(z) + \mathbf{c_0}$ from linearizations of the component parts, $\mathbf{a}(z)$ and $\mathbf{b}(z)$. This allows the extension to matrix polynomials of a new companion matrix construction.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes