Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
Michiel E. Hochstenbach, Christian Mehl, Bor Plestenjak · SIAM Journal on Matrix Analysis and Applications · 2019
Generalized eigenvalue problems involving a singular pencil are very challenging to solve, with respect to both accuracy and efficiency. The existing package Guptri is very elegant but may be time-demanding, even for small and medium-sized matrices. We propose a simple method to compute the eigenvalues of singular pencils, based on one perturbation of the original problem of a certain specific rank. For many problems, the method is both fast and robust. This approach may be seen as a welcome alternative to staircase methods.