Hartree-Fock calculations with linearly scaling memory usage.
We present an implementation of a set of algorithms for performing Hartree-Fock calculations with resource requirements in terms of both time and memory directly proportional to the system size. In particular, a way of directly computing the Hartree-Fock exchange matrix in sparse form is described which gives only small addressing overhead. Linear scaling in both time and memory is demonstrated in benchmark calculations for system sizes up to 11 650 atoms and 67 204 Gaussian basis functions on a single computer with 32 Gbytes of memory. The sparsity of overlap, Fock, and density matrices as well as band gaps are also shown for a wide range of system sizes, for both linear and three-dimensional systems.
Rudberg
Elias
E
Department of Theoretical Chemistry, School of Biotechnology, Royal Institute of Technology, Stockholm, Sweden. elias@theochem.kth.se
Rubensson
Emanuel H
EH
Sałek
Paweł
P
D000465:Algorithms; D003198:Computer Simulation; D004151:Dipeptides / Q000737:chemistry*; D008568:Memory; D008958:Models, Molecular; D011789:Quantum Theory; D013997:Time Factors
D004151:Dipeptides; C054122:alanylglutamine