Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation

From MaRDI portal



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.



Cites work


Cited in
(22)


Describes a project that uses

Uses Software






This page was built for publication: Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237897)