Determination of eigenstates via Lanczos-based forward substitution and filter- diagonalization (Q1372009): Difference between revisions

The authors use the basic Lanczos algorithm without re-orthogonalisation for the computation of quantum eigenstates. The thereby generated tridiagonal matrix is used again in order to filter out only Lanczos states in the vicinity of a desired energy band, similar to one step of inverse iteration. That way, only a few Lanczos states have to be kept. This avoids the storage of regeneration of all the Lanczos vectors, which otherwise would have been necessary. Herein lies the principal virtue and saving of the algorithm.