Solving singular generalized eigenvalue problems by a rank-completing perturbation

Abstract

Generalized eigenvalue problems involving a singular pencil are very challenging to solve, both with respect to accuracy and efficiency. The existing package Guptri is very elegant but may sometimes 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.

24 pages; revised version

References in corpus (1)

• Roots of bivariate polynomial systems via determinantal representations

Cited by in corpus (7)

• Computing zero-group-velocity points in anisotropic elastic waveguides: Globally and locally convergent methods
• One-particle Green's functions from the quantum equation of motion algorithm
• Solving singular generalized eigenvalue problems. Part II: projection and augmentation
• Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization
• Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils
• Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
• On properties and numerical computation of critical points of eigencurves of bivariate matrix pencils