.png){kind=icon}
.png){kind=icon}
Return
Efficient Parallel All-Electron Four-Component Dirac-Kohn Sham Program Using a Distributed Matrix Approach II
.png){kind=icon}
PRE
AI
DOI：10.1021/ct400752s.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new complete memory-distributed algorithm, which significantly improves the parallel implementation of the all-electron four-component Dirac-Kohn-Sham (DKS) module of BERTHA (J. Chem. Theory Comput. 2010, 6, 384). We devised an original procedure for mapping the DKS matrix between an efficient integral-driven distribution, guided by the structure of specific G-spinor basis sets and by density fitting algorithms, and the two-dimensional block-cyclic distribution scheme required by the ScaLAPACK library employed for the linear algebra operations. This implementation, because of the efficiency in the memory distribution, represents a leap forward in the applicability of the DKS procedure to arbitrarily large molecular systems and its porting on last-generation massively parallel systems. The performance of the code is illustrated by some test calculations on several gold clusters of increasing size. The DKS self-consistent procedure has been explicitly converged for two representative clusters, namely Au-20 and Au-34, for which the density of electronic states is reported and discussed. The largest gold cluster uses more than 39k basis functions and DKS matrices of the order of 23 GB.
Keywords:
DENSITY-FUNCTIONAL THEORY
BASIS-SETS
APPROXIMATION
MOLECULES
CHEMISTRY
FRAMEWORK
ELEMENTS
TENSORS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.5
Papers:
1.1W
Citations:
5.4W
View more organizations