On the reduction of matrix polynomials to Hessenberg form

@article{Cameron2016OnTR,
  title={On the reduction of matrix polynomials to Hessenberg form},
  author={Thomas R. Cameron},
  journal={Electronic Journal of Linear Algebra},
  year={2016},
  volume={31},
  pages={321-334}
}
  • T. R. Cameron
  • Published 5 February 2016
  • Mathematics
  • Electronic Journal of Linear Algebra
It is well known that every real or complex square matrix is unitarily similar to an upper Hessenberg matrix. The purpose of this paper is to provide a constructive proof of the result that every square matrix polynomial can be reduced to an upper Hessenberg matrix, whose entries are rational functions and in special cases polynomials. It will be shown that the determinant is preserved under this transformation, and both the finite and infinite eigenvalues of the original matrix polynomial can… 
2 Citations
Reduction of Matrix Polynomials to Simpler Forms
TLDR
This work introduces a practical means to reduce a matrix polynomial with nonsingular leading coefficient to a simpler (diagonal, triangular, Hessenberg) form while preserving the degree and the eigenstructure.
On the application of Laguerre's method to the polynomial eigenvalue problem
TLDR
An effective method based on the numerical range is presented for computing initial estimates to the eigenvalues of a matrix polynomial and its competitiveness for solving the roots of a polynomials and the tridiagonal eigenvalue problem is verified.

References

SHOWING 1-10 OF 10 REFERENCES
Triangularizing Quadratic Matrix Polynomials
TLDR
It is shown that for any monic linearization $\lambda I+A$ of an $n\times n$ quadratic matrix polynomial there exists a nonsingular matrix defined in terms of $n$ orthonormal vectors that transforms $A$ to a companion linearization of a (quasi-)triangular quadratics matrix poynomial.
Triangularizing matrix polynomials
Krylov type subspace methods for matrix polynomials
Some Perspectives on the Eigenvalue Problem
This expository paper explores the relationships among a number of algorithms for solving eigenvalue problems, including the power method, subspace iteration, the $QR$ algorithm, and the Arnoldi and
Hyman’s method applied to the general eigenvalue problem
This note is concerned with the problem of finding the roots of the determinanta equation I A + XB I = 0. If B is nonsingular, then the problem is equivalent to finding the roots of the equation I B
Numerical Methods for the Tridiagonal Hyperbolic Quadratic Eigenvalue Problem
  • Bor Plestenjak
  • Mathematics, Computer Science
    SIAM J. Matrix Anal. Appl.
  • 2006
TLDR
Numerical results show that the presented methods are more efficient than solving a linearized generalized eigenvalue problem.
Locating the Eigenvalues of Matrix Polynomials
TLDR
These extensions are applied to determine effective initial approximations for the numerical computation of the eigenvalues of matrix polynomials by means of simultaneous iterations, like the Ehrlich--Aberth method.
Rounding Errors in Algebraic Processes
TLDR
This book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts and this is simple, read the soft file of the book and you get it.
Matrix Polynomials
  • SIAM, Philadelphia, PA
  • 2009