Solving singular generalized eigenvalue problems. Part II: projection and augmentation

Abstract

Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two alternative methods. The first technique is based on a projection onto subspaces with dimension equal to the normal rank of the pencil while the second approach exploits an augmented matrix pencil. The projection approach seems to be the most attractive version for generic singular pencils because of its efficiency, while the augmented pencil approach may be suitable for applications where a linear system with the augmented pencil can be solved efficiently.

References in corpus (1)

• On the singular two-parameter eigenvalue problem II

Cited by in corpus (4)

• Computing zero-group-velocity points in anisotropic elastic waveguides: Globally and locally convergent methods
• 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