面向HPC架构的大规模DFT特征值问题的子空间递归Fermi算子展开策略
Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures
AI总结:
本文针对大规模Kohn-Sham DFT特征值问题中子空间对角化计算成本高的问题,提出基于递归Fermi算子展开的多项式展开替代策略,并在多节点CPU和GPU架构上系统比较了其与传统显式对角化方法在精度、效率、可扩展性和能效方面的表现。
摘要:
使用Kohn-Sham密度泛函理论(DFT)进行材料建模的量子力学计算涉及求解一个非线性特征值问题,即求解$N$个最小特征向量-特征值对,其中$N$与材料系统中的电子数成正比。这些计算在计算上要求很高,并且随着电子数的增加具有渐近三次方的标度复杂度。由采用系统收敛基组离散Kohn-Sham DFT方程而产生的大规模矩阵特征值问题,传统上依赖于迭代正交投影方法,这些方法已被证明在大规模并行计算架构上具有计算高效性和可扩展性。然而,随着材料系统尺寸的增大,已知这些方法的主要计算成本来自离散Kohn-Sham Hamiltonian矩阵的Rayleigh-Ritz投影步骤以及随后对投影矩阵的子空间对角化。本工作探索了基于递归Fermi算子展开的多项式展开方法作为投影Hamiltonian矩阵子空间对角化的替代方案,以降低计算成本。随后,我们在多节点CPU和GPU架构上对各种递归多项式展开方法与传统的显式对角化方法进行了详细比较,并从精度、计算效率、标度行为和能效方面评估了它们的相对性能。
英文摘要:
Quantum mechanical calculations for material modelling using Kohn-Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for $N$ smallest eigenvector-eigenvalue pairs with $N$ proportional to the number of electrons in the material system. These calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn-Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh-Ritz projection step of the discretized Kohn-Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node CPU and GPU architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behaviour and energy efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。