A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K
arXiv:2004.10811 · doi:10.1109/SC41405.2020.00084
Abstract
Electronic structure calculations based on density-functional theory (DFT) represent a significant part of today's HPC workloads and pose high demands on high-performance computing resources. To perform these quantum-mechanical DFT calculations on complex large-scale systems, so-called linear scaling methods instead of conventional cubic scaling methods are required. In this work, we take up the idea of the submatrix method and apply it to the DFT computations in the software package CP2K. For that purpose, we transform the underlying numeric operations on distributed, large, sparse matrices into computations on local, much smaller and nearly dense matrices. This allows us to exploit the full floating-point performance of modern CPUs and to make use of dedicated accelerator hardware, where performance has been limited by memory bandwidth before. We demonstrate both functionality and performance of our implementation and show how it can be accelerated with GPUs and FPGAs.
References in corpus (8)
- CP2K: An Electronic Structure and Molecular Dynamics Software Package -- Quickstep: Efficient and Accurate Electronic Structure Calculations
- Nearsightedness of Electronic Matter
- Graph-based linear scaling electronic structure theory
- FBLAS: Streaming Linear Algebra on FPGA
- Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
- A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
- Accurate Sampling with Noisy Forces from Approximate Computing
- A General Algorithm to Calculate the Inverse Principal -th Root of Symmetric Positive Definite Matrices