next up previous contents index
Next: Single- and Multiple-Vector Iterations Up: Generalized Hermitian Eigenvalue Problems Previous: Transformation to Standard Problem   Contents   Index


Direct Methods

In this section, we briefly discuss methods for computing eigenvalues and eigenvectors of dense matrices. With the factorization (5.4) of $B$, the GHEP (5.1) is reduced to the standard Hermitian eigenproblem (5.5). Then one may use the direct methods discussed in §4.2.

Specifically, in LAPACK [12], the following driver routines are provided for solving the GHEP (5.1) with $B$ positive definite:

Numerical analysis of the methods shows that if $B$ is ill-conditioned with respect to inversion, i.e., the condition number $\kappa_2(B) = \Vert B\Vert _2\Vert B^{-1}\Vert _2$ is large, the methods may be numerically unstable and/or have large errors in computed eigenvalues and eigenvectors. As yet there is no implementation of any direct method directly applicable to $A$ and $B$ while persevering with the symmetry of $A$ and $B$. An alternative approach would be to apply the QZ algorithm (see §8.2), but this will lose the symmetry.


next up previous contents index
Next: Single- and Multiple-Vector Iterations Up: Generalized Hermitian Eigenvalue Problems Previous: Transformation to Standard Problem   Contents   Index
Susan Blackford 2000-11-20