用于机器学习加速电子结构计算的电荷密度线性 Jacobi-Legendre 展开
Linear Jacobi-Legendre expansion of the charge density for machine learning-accelerated electronic structure calculations
AI总结:
本文提出基于 Jacobi-Legendre 多项式和线性回归的网格中心结构表示,用于机器学习快速准确预测 DFT 电荷密度及相关可观测量,显著降低电子结构计算成本。
摘要:
Kohn-Sham 密度泛函理论(KS-DFT)是获取材料关键性质的有力方法,但 KS 方程的迭代求解是一项数值密集型任务,这限制了其在复杂体系中的应用。为解决这一问题,机器学习(ML)模型可作为替代模型来寻找基态电荷密度并降低计算开销。我们开发了一种以网格为中心的结构表示方法,该方法基于 Jacobi 和 Legendre 多项式并结合线性回归,以准确学习收敛的 DFT 电荷密度。该方法集成到一个 ML 流程中,能够以收敛 DFT 计算的质量返回任何依赖于密度的可观测量,包括能量和力,而计算成本仅为其一小部分。能量景观的快速扫描以及为 DFT 自洽循环生成初始密度均属于我们方案的典型应用。
英文摘要:
Kohn-Sham density functional theory (KS-DFT) is a powerful method to obtain key materials' properties, but the iterative solution of the KS equations is a numerically intensive task, which limits its application to complex systems. To address this issue, machine learning (ML) models can be used as surrogates to find the ground-state charge density and reduce the computational overheads. We develop a grid-centred structural representation, based on Jacobi and Legendre polynomials combined with a linear regression, to accurately learn the converged DFT charge density. This integrates into a ML pipeline that can return any density-dependent observable, including energy and forces, at the quality of a converged DFT calculation, but at a fraction of the computational cost. Fast scanning of energy landscapes and producing starting densities for the DFT self-consistent cycle are among the applications of our scheme.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。