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

  title={Solving singular generalized eigenvalue problems. Part II: projection and augmentation},
  author={Michiel E. Hochstenbach and Christian Mehl and Bor Plestenjak},
. 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… 
1 Citations

Computing zero-group-velocity points in anisotropic elastic waveguides: globally and locally convergent methods

Dispersion curves of elastic waveguides exhibit points where the group velocity vanishes while the wavenumber remains finite. These are the so-called zero-group-velocity (ZGV) points. As the



Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation

A simple method to compute the eigenvalues of singular pencils, based on one perturbation of the original problem of a certain specific rank, which may be seen as a welcome alternative to staircase methods.

On the singular two-parameter eigenvalue problem II

Some modified matrix eigenvalue problems

  • G. Golub
  • Mathematics
    Milestones in Matrix Computation
  • 2007
This work considers the numerical calculation of several matrix eigenvalue problems which require some manipulation before the standard algorithms may be used, and studies several eigen value problems which arise in least squares.


It is shown that the simple finite regular eigenvalues of a two-parameter eigen value problem and the associated system of generalized eigenvalue problems agree.

Singular quadratic eigenvalue problems: Linearization and weak condition numbers

It is proved that the eigenvalue condition number is, with high probability, a reliable criterion for detecting and excluding spurious eigenvalues created from the singular part.

Wilkinson’s Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems

A new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theories fail to predict the observed accuracy of computed solutions, which is a more powerful predictor of the accuracy of computations than existing tools.

Uniform Determinantal Representations

The notion of a uniform determinantal representation, not of a single polynomial but rather of all polynomials in a given number of variables and of a given maximal degree is introduced.

Root polynomials and their role in the theory of matrix polynomials