The application of the Ehrlich‐Aberth method to structured polynomial eigenvalue problems
Vanni Noferini · PAMM · 2011
Abstract An algorithm for the application of the Ehrlich‐Aberth method to polynomial eigenvalue problems (PEPs) is proposed. The computational complexity of the algorithm is only quadratic with respect to the degree of the polynomial, where customary matrix methods have cubic complexity. For the case of some structured PEPs a strategy is given in order to exploit the structure and obtain the induced coupling in the spectrum. Numerical experiments are provided for the particular case of even/odd PEPs. This communication is based on joint work with Dario A. Bini and Luca Gemignani. (© 2011 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)