Sparse approximate matrix-matrix multiplication for density matrix purification with error control

Abstract

We propose a method for strict error control in sparse approximate matrix-matrix multiplication. The method combines an error bound and a parameter sweep to select an appropriate threshold value. The scheme for error control and the sparse approximate multiplication are implemented using the Chunks and Tasks parallel programming model. We demonstrate the performance of the method in parallel linear scaling electronic structure calculations using density matrix purification with rigorous error control.

9 pages, 3 figures

References in corpus (7)

• Non-monotonic recursive polynomial expansions for linear scaling calculation of the density matrix
• Mixed Precision Fermi-Operator Expansion on Tensor Cores From a Machine Learning Perspective
• Locality-aware parallel block-sparse matrix-matrix multiplication using the Chunks and Tasks programming model
• Parameterless stopping criteria for recursive density matrix expansions
• A $N$-Body Solver for Square Root Iteration
• Approximate multiplication of nearly sparse matrices with decay in a fully recursive distributed task-based parallel framework
• Efficient computation of the density matrix with error control on distributed computer systems