Abstract
AbstractAn 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)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
