We develop and test an algorithm for the computation of a fixed number of the lowest eigenstates of a Hermitian operator. The algorithm is iterative and converges exponentially. We test the algorithm on the strong-coupled Hubbard model, which has a finite number of basis states, and we reproduce known results. We also compute with a partial basis, a subset of a complete basis. We show how to extrapolate the eigenvalues to the full basis result. This opens the possibility of applying the algorithm to problems having an infinite number of basis states.
Read full abstract