On a modification of the EVEN‐IRA algorithm for the solution of T ‐even polynomial eigenvalue problems
Heike Faßbender, Philip Saltenberger · PAMM · 2018
Abstract We discuss the numerical solution of T ‐even n × n polynomial eigenvalue problems and show how a small portion of the spectrum can be obtained using just 𝒪( n 3 ) arithmetic operations. For that purpose, we apply the EVEN‐IRA algorithm proposed in [1] to a special structure‐preserving linearization. In this particular situation, the Arnolid iteration as a main part of the EVEN‐IRA algorithm can be realized very efficiently.