Parallel sparse matrix multiplication for linear scaling electronic structure calculations
From MaRDI portal
Abstract: Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must be run on parallel computers. We analyse the problem of parallelising the multiplication of sparse matrices with the sparsity pattern required by linear-scaling techniques. We show that the management of inter-node communications and the effective use of on-node cache are helped by organising the atoms into compact groups. We also discuss how to identify a key part of the code called the `multiplication kernel', which is repeatedly invoked to build up the matrix product, and explicit code is presented for this kernel. Numerical tests of the resulting multiplication code are reported for cases of practical interest, and it is shown that their scaling properties for systems containing up to 20,000 atoms on machines having up to 512 processors are excellent. The tests also show that the cpu efficiency of our code is satisfactory.
Recommendations
- scientific article; zbMATH DE number 1163095
- Parallel sparse matrix solution and performance
- Sparse Matrix Computations on Parallel Processor Arrays
- Parallel solving large-scale sparse matrix eigenvalue problems
- Large-Scale Scientific Computing
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- scientific article; zbMATH DE number 4070168
- Parallel algorithm of sparse matrix multiplying
- Computational Science – ICCS 2005
- scientific article; zbMATH DE number 1817673
Cites work
Cited in
(16)- Massively parallel linear-scaling algorithm in an ab initio local-orbital total-energy method
- Multithreaded shared memory parallel implementation of the electronic structure code GAMESS
- A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
- A parallel R-matrix program PRMAT for electron-atom and electron-ion scattering calculations
- Sparse grids approximation of Goldstone diagrams in electronic structure calculations
- Sparse approximate matrix-matrix multiplication for density matrix purification with error control
- Decay bounds for functions of Hermitian matrices with banded or Kronecker structure
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- Solvers for \(\mathcal{O}(N)\) electronic structure in the strong scaling limit
- Efficient multi-scale computation of products of orbitals in electronic structure calculations
- scientific article; zbMATH DE number 1206091 (Why is no real title available?)
- scientific article; zbMATH DE number 1953312 (Why is no real title available?)
- Linear-scaling density-functional-theory calculations of electronic structure based on real-space grids: Design, analysis, and scalability test of parallel algorithms
- Massively parallel sparse matrix function calculations with NTPoly
- Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
- Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants
This page was built for publication: Parallel sparse matrix multiplication for linear scaling electronic structure calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944577)
