Numerical methods for eigenvalues of singular polynomial eigenvalue problems

Abstract

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation have been developed. We show that all three approaches can be generalized to treat singular polynomial eigenvalue problems. The common denominator of all three approaches is a transformation of a singular into a regular matrix polynomial whose eigenvalues are a disjoint union of the eigenvalues of the singular polynomial, called true eigenvalues, and additional fake eigenvalues. The true eigenvalues can then be separated from the fake eigenvalues using information on the corresponding left and right eigenvectors. We illustrate the approaches on several interesting applications, including bivariate polynomial systems and ZGV points.