Mejía Leopoldo, Sharma Sandeep, Baer Roi, Chan Garnet Kin-Lic, Rabani Eran
Department of Chemistry, University of California, Berkeley, California 94720, United States.
Materials Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, United States.
J Chem Theory Comput. 2024 Sep 10;20(17):7494-7502. doi: 10.1021/acs.jctc.4c00862. Epub 2024 Aug 27.
Stochastic orbital techniques offer reduced computational scaling and memory requirements to describe ground and excited states at the cost of introducing controlled statistical errors. Such techniques often rely on two basic operations, stochastic trace estimation and stochastic resolution of identity, both of which lead to statistical errors that scale with the number of stochastic realizations () as . Reducing the statistical errors without significantly increasing has been challenging and is central to the development of efficient and accurate stochastic algorithms. In this work, we build upon recent progress made to improve stochastic trace estimation based on the ubiquitous Hutchinson's algorithm and propose a two-step approach for the stochastic resolution of identity, in the spirit of the Hutch++ method. Our approach is based on employing a randomized low-rank approximation followed by a residual calculation, resulting in statistical errors that scale much better than . We implement the approach within the second-order Born approximation for the self-energy in the computation of neutral excitations and discuss three different low-rank approximations for the two-body Coulomb integrals. Tests on a series of hydrogen dimer chains with varying lengths demonstrate that the Hutch++-like approximations are computationally more efficient than both deterministic and purely stochastic (Hutchinson) approaches for low error thresholds and intermediate system sizes. Notably, for arbitrarily large systems, the Hutchinson-like approximation outperforms both deterministic and Hutch++-like methods.
随机轨道技术以引入可控统计误差为代价,降低了描述基态和激发态时的计算规模和内存需求。此类技术通常依赖于两种基本操作,即随机迹估计和单位矩阵的随机分解,这两种操作都会导致统计误差,其随随机实现次数()的变化关系为 。在不显著增加 的情况下减少统计误差一直具有挑战性,并且是高效且准确的随机算法发展的核心。在这项工作中,我们基于最近在改进基于普遍存在的哈钦森算法的随机迹估计方面所取得的进展,并本着Hutch++方法的精神,提出了一种用于单位矩阵随机分解的两步法。我们的方法基于采用随机低秩近似,然后进行残差计算,从而产生比 要好得多的统计误差缩放关系。我们在计算中性激发态的自能时,在二阶玻恩近似内实现了该方法,并讨论了两体库仑积分的三种不同低秩近似。对一系列不同长度的氢二聚体链进行的测试表明,对于低误差阈值和中等系统规模,类Hutch++近似在计算上比确定性方法和纯随机(哈钦森)方法都更高效。值得注意的是,对于任意大的系统,类哈钦森近似优于确定性方法和类Hutch++方法。