Low‐memory iterative density fitting |
| |
| Authors: | Lukáš Grajciar |
| |
| Affiliation: | Otto‐Schott‐Institut für Materialforschung, Friedrich‐Schiller‐Universit?t Jena, Jena, Germany |
| |
| Abstract: | A new low‐memory modification of the density fitting approximation based on a combination of a continuous fast multipole method (CFMM) and a preconditioned conjugate gradient solver is presented. Iterative conjugate gradient solver uses preconditioners formed from blocks of the Coulomb metric matrix that decrease the number of iterations needed for convergence by up to one order of magnitude. The matrix‐vector products needed within the iterative algorithm are calculated using CFMM, which evaluates them with the linear scaling memory requirements only. Compared with the standard density fitting implementation, up to 15‐fold reduction of the memory requirements is achieved for the most efficient preconditioner at a cost of only 25% increase in computational time. The potential of the method is demonstrated by performing density functional theory calculations for zeolite fragment with 2592 atoms and 121,248 auxiliary basis functions on a single 12‐core CPU workstation. © 2015 Wiley Periodicals, Inc. |
| |
| Keywords: | density functional theory density fitting memory efficient algorithm preconditioned conjugate gradient method continuous fast multipole method |
|
|
