Chebyshev polynomial filtered subspace iteration in the Discontinuous Galerkin method for large-scale electronic structure calculations

Abstract

The Discontinuous Galerkin (DG) electronic structure method employs an adaptive local basis (ALB) set to solve the Kohn-Sham equations of density functional theory (DFT) in a discontinuous Galerkin framework. The adaptive local basis is generated on-the-fly to capture the local material physics, and can systematically attain chemical accuracy with only a few tens of degrees of freedom per atom. A central issue for large-scale calculations, however, is the computation of the electron density (and subsequently, ground state properties) from the discretized Hamiltonian in an efficient and scalable manner. We show in this work how Chebyshev polynomial filtered subspace iteration (CheFSI) can be used to address this issue and push the envelope in large-scale materials simulations in a discontinuous Galerkin framework. We describe how the subspace filtering steps can be performed in an efficient and scalable manner using a two-dimensional parallelization scheme, thanks to the orthogonality of the DG basis set and block-sparse structure of the DG Hamiltonian matrix. The on-the-fly nature of the ALBs requires additional care in carrying out the subspace iterations. We demonstrate the parallel scalability of the DG-CheFSI approach in calculations of large-scale two-dimensional graphene sheets and bulk three-dimensional lithium-ion electrolyte systems. Employing 55,296 computational cores, the time per self-consistent field iteration for a sample of the bulk 3D electrolyte containing 8,586 atoms is 90 seconds, and the time for a graphene sheet containing 11,520 atoms is 75 seconds.

Submitted to The Journal of Chemical Physics

References in corpus (8)

• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• Parallel Self-Consistent-Field Calculations via Chebyshev-Filtered Subspace Acceleration
• SPARC: Accurate and efficient finite-difference formulation and parallel implementation of Density Functional Theory: Isolated clusters
• Periodic Pulay method for robust and efficient convergence acceleration of self-consistent field iterations
• Cyclic Density Functional Theory : A route to the first principles simulation of bending in nanostructures
• SIESTA-PEXSI: Massively parallel method for efficient and accurate \textit{ab initio} materials simulation without matrix diagonalization
• Adaptive local basis set for Kohn-Sham density functional theory in a discontinuous Galerkin framework II: Force, vibration, and molecular dynamics calculations
• A posteriori error estimates for discontinuous Galerkin methods using non-polynomial basis functions. Part II: Eigenvalue problems

Cited by in corpus (14)

• ELSI -- An Open Infrastructure for Electronic Structure Solvers
• Cyclic Density Functional Theory : A route to the first principles simulation of bending in nanostructures
• Ab initio framework for systems with helical symmetry: theory, numerical implementation and applications to torsional deformations in nanostructures
• Bethe Salpeter Equation Spectra for Very Large Systems
• Orbital-enriched Flat-top Partition of Unity Method for the Schrödinger Eigenproblem
• Chebyshev Filter Diagonalization on Modern Manycore Processors and GPGPUs
• Chebyshev Polynomial Method to Landauer-Büttiker Formula of Quantum Transport in Nanostructures
• Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
• Globally Constructed Adaptive Local Basis Set for Spectral Projectors of Second Order Differential Operators
• Triangularized Orthogonalization-free Method for Solving Extreme Eigenvalue Problems
• Discontinuous Galerkin discretization for quantum simulation of chemistry
• Interpolative Separable Density Fitting through Centroidal Voronoi Tessellation With Applications to Hybrid Functional Electronic Structure Calculations
• A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation
• A Parallel Direct Eigensolver for Sequences of Hermitian Eigenvalue Problems with No Tridiagonalization