arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.04880cond-mat.mtrl-sciphysics.chem-phphysics.comp-ph
收藏

使用张量超收缩与k点采样的低标度随机相位近似算法

Low-Scaling Algorithm for the Random Phase Approximation using Tensor Hypercontraction with k-point Sampling

Chia-Nan Yeh, Miguel A. Morales

AI总结:

本文提出一种基于张量超收缩和k点采样的低标度随机相位近似算法,通过修正的ISDF程序获得动量依赖辅助基组,使计算随k点数线性、随系统尺寸立方标度,且无需轨道稀疏性假设,误差收敛迅速。

摘要:

我们提出了一种在张量超收缩(THC)框架下、针对电子排斥积分(ERIs)并采用k点采样的低标度随机相位近似(RPA)算法。THC分解通过一种修正的插值可分离密度拟合(ISDF)程序获得,该程序使用动量依赖的辅助基组来处理一般的单粒子布洛赫轨道。我们的公式不需要预先优化的插值点或辅助基组,其精度可通过插值点的数量进行系统控制。所得的RPA算法随k点数量呈线性标度,并随系统尺寸呈立方标度,且无需对轨道的稀疏性或局域性作任何假设。电子排斥积分和RPA能量的误差随THC辅助基组尺寸的增大而快速收敛,这表明该方向有望为大规模系统构建高效的高阶多体微扰理论算法提供一条稳健且有前景的途径。

英文摘要:

We present a low-scaling algorithm for the random phase approximation (RPA) with \textbf{k}-point sampling in the framework of tensor hypercontraction (THC) for electron repulsion integrals (ERIs). The THC factorization is obtained via a revised interpolative separable density fitting (ISDF) procedure with a momentum-dependent auxiliary basis for generic single-particle Bloch orbitals. Our formulation does not require pre-optimized interpolating points nor auxiliary bases, and the accuracy is systematically controlled by the number of interpolating points. The resulting RPA algorithm scales linearly with the number of \textbf{k}-points and cubically with the system size without any assumption on sparsity or locality of orbitals. The errors of ERIs and RPA energy show rapid convergence with respect to the size of the THC auxiliary basis, suggesting a promising and robust direction to construct efficient algorithms of higher-order many-body perturbation theories for large-scale systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑