Author:

Keywords:

matrix polynomial, core chasing algorithm, product eigenvalue problem, eigenvector, eigenvalue, Science & Technology, Physical Sciences, Mathematics, Applied, Mathematics, Matrix polynomial, eigenvalues, eigenvectors, LINEARIZATIONS, ALGORITHM, PRODUCT, ROOTS, C14/16/056#53765160, 0102 Applied Mathematics, 0103 Numerical and Computational Mathematics, 0802 Computation Theory and Mathematics, Numerical & Computational Mathematics, 4901 Applied mathematics, 4903 Numerical and computational mathematics

Abstract:

In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for computing a factored Schur form of the associated companion pencil. The algorithm has a quadratic cost in the degree of the polynomial and a cubic one in the size of the coefficient matrices. Also the eigenvectors can be computed at the same cost. The algorithm is a variant of Francis’s implicitly shifted QR algorithm applied on the com- panion pencil. A preprocessing unitary equivalence is executed on the matrix polynomial to simultaneously bring the leading matrix coefficient and the constant matrix term to triangular form before forming the companion pencil. The resulting structure allows us to stably factor each matrix of the pencil as a product of k matrices of unitary-plus-rank-one form, admitting cheap and numerically reliable storage. The problem is then solved as a product core chasing eigenvalue problem. A backward error analysis is included, implying normwise backward stabil- ity after a proper scaling. Computing the eigenvectors via reordering the Schur form is discussed as well. Numerical experiments illustrate stability and efficiency of the proposed methods.