Computing the lowest eigenvalues of the Fermion matrix by subspace iterations

Abstract

Subspace iterations are used to minimise a generalised Ritz functional of a large, sparse Hermitean matrix. In this way, the lowest $m$ eigenvalues are determined. Tests with $1\le m\le 32$ demonstrate that the computational cost (no. of matrix multiplies) does not increase substantially with $m$. This implies that, as compared to the case of a $m=1$, the additional eigenvalues are obtained for free.

Comments: Talk presented at LATTICE96(algorithms), 3 pages, 2 Postscript figures, uses epsf.sty, espcrc2.sty