计算机科学
实施
一套
基础(线性代数)
高斯分布
计算科学
并行计算
算法
稀疏矩阵
密度泛函理论
高斯消去
基质(化学分析)
理论计算机科学
数据结构
计算机工程
高斯过程
重点(电信)
基函数
钻石
成本效益
巨量平行
库达
高效算法
编码(内存)
超级计算机
线性系统
现场可编程门阵列
作者
Ryan Stocks,Giuseppe M. J. Barca
标识
DOI:10.1021/acs.jctc.5c01229
摘要
Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. Improving algorithmic efficiency through hardware-aware implementations enables application to larger systems and more efficient generation of larger training data sets for machine-learning. In this work, we present a comparative study of four GPU-accelerated algorithms for evaluating the KS-DFT exchange–correlation (XC) potential with an atom-centered Gaussian basis. Two approaches, both leveraging batched dense linear algebra, are found to outperform the others across a suite of molecular benchmarks. We show that batched formation of the XC matrix from the density matrix yields the best performance for large ( > O ( 10 3 ) basis functions), sparse systems such as glycine chains and water clusters. In contrast, for smaller and denser systems such as diamond nanoparticles, especially if employing large basis sets, algorithms that use the underlying molecular orbital coefficients offer superior performance, despite their higher formal scaling. Our implementations deliver speedups of 1.4–5.2× for XC potential evaluation relative to leading GPU-accelerated KS-DFT codes, significantly lowering the computational cost and enabling the routine use of larger integration grids. Finally, we outline directions for continued performance improvements in light of emerging GPU architectures with emphasis on utilizing mixed-precision capabilities.
科研通智能强力驱动
Strongly Powered by AbleSci AI