Your browser doesn't support javascript.
loading
A robust variant of block Jacobi-Davidson for extracting a large number of eigenpairs: Application to grid-based real-space density functional theory.
Lee, M; Leiter, K; Eisner, C; Breuer, A; Wang, X.
Affiliation
  • Lee M; Simulation Sciences Branch, U.S. Army Research Laboratory, Aberdeen Proving Ground, Maryland 21005, USA.
  • Leiter K; Simulation Sciences Branch, U.S. Army Research Laboratory, Aberdeen Proving Ground, Maryland 21005, USA.
  • Eisner C; Simulation Sciences Branch, U.S. Army Research Laboratory, Aberdeen Proving Ground, Maryland 21005, USA.
  • Breuer A; Simulation Sciences Branch, U.S. Army Research Laboratory, Aberdeen Proving Ground, Maryland 21005, USA.
  • Wang X; Simulation Sciences Branch, U.S. Army Research Laboratory, Aberdeen Proving Ground, Maryland 21005, USA.
J Chem Phys ; 147(11): 114109, 2017 Sep 21.
Article in En | MEDLINE | ID: mdl-28938809
ABSTRACT
In this work, we investigate a block Jacobi-Davidson (J-D) variant suitable for sparse symmetric eigenproblems where a substantial number of extremal eigenvalues are desired (e.g., ground-state real-space quantum chemistry). Most J-D algorithm variations tend to slow down as the number of desired eigenpairs increases due to frequent orthogonalization against a growing list of solved eigenvectors. In our specification of block J-D, all of the steps of the algorithm are performed in clusters, including the linear solves, which allows us to greatly reduce computational effort with blocked matrix-vector multiplies. In addition, we move orthogonalization against locked eigenvectors and working eigenvectors outside of the inner loop but retain the single Ritz vector projection corresponding to the index of the correction vector. Furthermore, we minimize the computational effort by constraining the working subspace to the current vectors being updated and the latest set of corresponding correction vectors. Finally, we incorporate accuracy thresholds based on the precision required by the Fermi-Dirac distribution. The net result is a significant reduction in the computational effort against most previous block J-D implementations, especially as the number of wanted eigenpairs grows. We compare our approach with another robust implementation of block J-D (JDQMR) and the state-of-the-art Chebyshev filter subspace (CheFSI) method for various real-space density functional theory systems. Versus CheFSI, for first-row elements, our method yields competitive timings for valence-only systems and 4-6× speedups for all-electron systems with up to 10× reduced matrix-vector multiplies. For all-electron calculations on larger elements (e.g., gold) where the wanted spectrum is quite narrow compared to the full spectrum, we observe 60× speedup with 200× fewer matrix-vector multiples vs. CheFSI.

Full text: 1 Collection: 01-internacional Database: MEDLINE Language: En Journal: J Chem Phys Year: 2017 Document type: Article Affiliation country: Estados Unidos

Full text: 1 Collection: 01-internacional Database: MEDLINE Language: En Journal: J Chem Phys Year: 2017 Document type: Article Affiliation country: Estados Unidos
...