Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
