arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.03192physics.comp-phcs.MSphysics.chem-ph
收藏

3中心Gaussian积分的内存高效递归求值

Memory-Efficient Recursive Evaluation of 3-Center Gaussian Integrals

Andrey Asadchev, Edward F. Valeev

AI总结:

为提高现代加速架构上Gaussian积分的求值效率,本文优化了基于Obara-Saika的递归方案的内存占用,利用多量子递归和编译时内核生成等技术显著节省了3中心2粒子积分的内存,并在开源库LibintX中验证了其性能。

摘要:

为了提高现代加速架构上Gaussian积分求值的效率,对基于Obara-Saika的FLOP高效递归求值方案进行了内存占用优化。对于在密度拟合近似中求值Coulomb及其他2粒子相互作用起关键作用的3中心2粒子积分,使用多量子递归(即一次创建或转移多个量子)被证明能产生显著的内存节省。其他创新包括利用寄存器内存以减少内存占用,以及利用现代C++/CUDA的编译时特性直接生成优化内核(而非自定义代码生成)。对于所提方案的传统实现和基于CUDA的实现,本文展示了其在包含高达低和高角动量(高达$L=6$)及收缩度的单个积分批次,以及基于密度拟合的Coulomb势求值中的性能。该计算机实现可在开源LibintX库中获取。

英文摘要:

To improve the efficiency of Gaussian integral evaluation on modern accelerated architectures FLOP-efficient Obara-Saika-based recursive evaluation schemes are optimized for the memory footprint. For the 3-center 2-particle integrals that are key for the evaluation of Coulomb and other 2-particle interactions in the density-fitting approximation the use of multi-quantal recurrences (in which multiple quanta are created or transferred at once) is shown to produce significant memory savings. Other innovation include leveraging register memory for reduced memory footprint and direct compile-time generation of optimized kernels (instead of custom code generation) with compile-time features of modern C++/CUDA. Performance of conventional and CUDA-based implementations of the proposed schemes is illustrated for both the individual batches of integrals involving up to Gaussians with low and high angular momenta (up to $L=6$) and contraction degrees, as well as for the density-fitting-based evaluation of the Coulomb potential. The computer implementation is available in the open-source LibintX library.

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

↑