On the sparse matrix computation of critical frequencies

An algorithm for finding the eigenvalues of the generalized eigenvalue problem
Ax = {\lambda}Bx
for sparse
A
and
B
matrices is discussed. Its performance is compared to that of the
QZ
algorithm for some test matrices.