Efficient Computation of Sparse Matrix Functions for Large-Scale Electronic Structure Calculations: The CheSS Library

Abstract

We present CheSS, the "Chebyshev Sparse Solvers" library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.

References in corpus (7)

• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• Recent progress with large-scale ab initio calculations: the CONQUEST code
• Challenges in Large Scale Quantum Mechanical Calculations
• Spin unrestricted linear scaling electronic structure theory and its application to magnetic carbon doped BN nanotubes
• SIESTA-PEXSI: Massively parallel method for efficient and accurate \textit{ab initio} materials simulation without matrix diagonalization
• Complexity Reduction in Large Quantum Systems: Fragment Identification and Population Analysis via a Local Optimized Minimal Basis
• Complexity Reduction in Large Quantum Systems: Reliable Electrostatic Embedding for Multiscale Approaches via Optimized Minimal Basis Functions

Cited by in corpus (17)

• SIESTA: recent developments and applications
• ELSI: A Unified Software Interface for Kohn-Sham Electronic Structure Solvers
• Block2: a comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond
• Roadmap on Electronic Structure Codes in the Exascale Era
• ELSI -- An Open Infrastructure for Electronic Structure Solvers
• Efficient All-electron Hybrid Density Functionals for Atomistic Simulations Beyond 10,000 Atoms
• Linear scaling DFT calculations for large Tungsten systems using an optimized local basis
• The CECAM Electronic Structure Library and the modular software development paradigm
• Complexity Reduction in Density Functional Theory Calculations of Large Systems: System Partitioning and Fragment Embedding
• Lifetime effects and satellites in the photoelectron spectrum of tungsten metal
• Thermal and Oxidation Stability of Ti${}_x$W${}_{1-x}$ Diffusion Barriers Investigated by Soft and Hard X-ray Photoelectron Spectroscopy
• A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
• Complexity Reduction in Density Functional Theory: Locality in Space and Energy
• Approximate multiplication of nearly sparse matrices with decay in a fully recursive distributed task-based parallel framework
• Positivity Preserving Density Matrix Minimization at Finite Temperatures via Square Root
• Toward Density Functional Theory on Quantum Computers?
• Approximating Sparse Matrices and their Functions using Matrix-vector products