Recursive Factorization of the Inverse Overlap Matrix in Linear-Scaling Quantum Molecular Dynamics Simulations
- 24 June 2016
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 12 (7) , 3063-3073
Abstract
We present a reduced complexity algorithm to compute the inverse overlap factors required to solve the generalized eigenvalue problem in a quantum-based molecular dynamics (MD) simulation. Our method is based on the recursive, iterative refinement of an initial guess of Z (inverse square root of the overlap matrix S). The initial guess of Z is obtained beforehand by using either an approximate divide-and-conquer technique or dynamical methods, propagated within an extended Lagrangian dynamics from previous MD time steps. With this formulation, we achieve long-term stability and energy conservation even under the incomplete, approximate, iterative refinement of Z. Linear-scaling performance is obtained using numerically thresholded sparse matrix algebra based on the ELLPACK-R sparse matrix data format, which also enables efficient shared-memory parallelization. As we show in this article using self-consistent density-functional-based tight-binding MD, our approach is faster than conventional methods based on the diagonalization of overlap matrix S for systems as small as a few hundred atoms, substantially accelerating quantum-based simulations even for molecular structures of intermediate size. For a 4158-atom water-solvated polyalanine system, we find an average speedup factor of 122 for the computation of Z in each MD step.Keywords
Funding Information
- Basic Energy Sciences (LANL2014E8AN)
- Laboratory Directed Research and Development
- U.S. Department of Energy (DE-AC52-06NA25396)
This publication has 47 references indexed in Scilit:
- Analysis of Time Reversible Born-Oppenheimer Molecular DynamicsEntropy, 2013
- Linear Scaling Self-Consistent Field Calculations with Millions of Atoms in the Condensed PhaseJournal of Chemical Theory and Computation, 2012
- Car–Parrinello molecular dynamicsWIREs Computational Molecular Science, 2011
- Lagrangian formulation with dissipation of Born-Oppenheimer molecular dynamics using the density-functional tight-binding methodThe Journal of Chemical Physics, 2011
- Dynamical simulation of the optical response of photosynthetic pigmentsPhysical Chemistry Chemical Physics, 2010
- Force Field Bias in Protein Folding SimulationsBiophysical Journal, 2009
- A hierarchic sparse matrix data structure for large‐scale Hartree‐Fock/Kohn‐Sham calculationsJournal of Computational Chemistry, 2007
- Molecular Dynamics: Survey of Methods for Simulating the Activity of ProteinsChemical Reviews, 2006
- Expansion algorithm for the density matrixPhysical Review B, 2002
- A general parallel sparse-blocked matrix multiply for linear scaling SCF theoryComputer Physics Communications, 2000