The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317): Difference between revisions

The authors present a new method for computing the eigenvalues of the T-palindromic matrix polynomial \(\sum _{i=0}^kA_iz^i\), with \(A_i^T=A_{k-i}\) and \(A_k\neq 0\), and investigate its properties. Their approach, which can also be used for the purely palindromic polynomial (\(A_i=A_{k-i}\)), is based on the Ehrlich-Aberth root-finding algorithm, which was recently used for other structured matrix eigenproblems by \textit{D. A.\ Bini, L.\ Gemignani} and \textit{F.\ Tisseur} [SIAM J.\ Matrix Anal.\ Appl.\ 27, No. 1, 153--175 (2005; Zbl 1089.65030)].