Efficient computation of the density matrix with error control on distributed computer systems

09/27/2019
by   Anastasia Kruchinina, et al.
0

The recursive polynomial expansion for construction of a density matrix approximation with rigorous error control [J. Chem. Phys. 128, 074106 (2008)] is implemented in the quantum chemistry program Ergo [SoftwareX 7, 107 (2018)] using the Chunks and Tasks matrix library [Parallel Comput. 57, 87 (2016)]. The expansion is based on second-order polynomials and accelerated by the scale-and-fold technique [J. Chem. Theory Comput. 7, 1233 (2011)]. We evaluate the performance of the implementation by computing the density matrix from the Fock matrix in the large-scale self-consistent field calculations. We demonstrate that the amount of communicated data per worker process tends to a constant with increasing system size and number of computer nodes such that the amount of work per worker process is fixed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2023

Implementation of the Density-functional Theory on Quantum Computers with Linear Scaling with respect to the Number of Atoms

Density-functional theory (DFT) has revolutionized computer simulations ...
research
05/20/2020

Sparse approximate matrix-matrix multiplication with error control

We propose a method for strict error control in sparse approximate matri...
research
08/28/2018

Spectrum-Adapted Polynomial Approximation for Matrix Functions

We propose and investigate two new methods to approximate f( A) b for la...
research
04/22/2020

A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K

Electronic structure calculations based on density-functional theory (DF...
research
09/03/2020

Black-box inhomogeneous preconditioning for self-consistent field iterations in density functional theory

We propose a new preconditioner for computing the self-consistent proble...
research
08/03/2021

A well-conditioned direct PinT algorithm for first- and second-order evolutionary equations

In this paper, we propose a direct parallel-in-time (PinT) algorithm for...

Please sign up or login with your details

Forgot password? Click here to reset