arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.01454math.NAcs.NAphysics.comp-ph
收藏

电子结构自洽计算的随机算法

Stochastic Algorithms for Self-consistent Calculations of Electronic Structures

Taehee Ko, Xiantao Li

AI总结:

本文研究电子结构自洽场计算的随机算法,利用矩阵函数迹的统计平均与Krylov子空间近似使每次迭代仅采样一个随机向量,并证明了在几乎必然有界和二阶矩条件下迭代分别具有均方收敛与依概率收敛。

摘要:

研究了一种用于电子结构自洽场(SCF)计算的随机算法的收敛性质。该算法通过将电子电荷重写为矩阵函数的迹/对角线来表述,随后将其表示为统计平均。该函数进一步使用Krylov子空间近似来逼近。因此,每次SCF迭代只需采样一个随机向量,而无需计算所有轨道。我们考虑了带阻尼和混合的SCF迭代的常见做法。在适当的假设下,我们证明了当随机误差具有几乎必然有界时,迭代在均方意义下收敛。我们还考虑了当该假设弱化为二阶矩条件时的情形,并证明了依概率收敛。

英文摘要:

The convergence property of a stochastic algorithm for the self-consistent field (SCF) calculations of electron structures is studied. The algorithm is formulated by rewriting the electron charges as a trace/diagonal of a matrix function, which is subsequently expressed as a statistical average. The function is further approximated by using a Krylov subspace approximation. As a result, each SCF iteration only samples one random vector without having to compute all the orbitals. We consider the common practice of SCF iterations with damping and mixing. We prove with appropriate assumptions that the iterations converge in the mean-square sense, when the stochastic error has an almost sure bound. We also consider the scenario when such an assumption is weakened to a second moment condition, and prove the convergence in probability.

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

↑