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

电子结构计算的梯度型优化方法

Gradient type optimization methods for electronic structure calculations

Xin Zhang, Jinwei Zhu, Zaiwen Wen, Aihui Zhou

摘要:

电子结构计算中的密度泛函理论(DFT)可以表述为非线性本征值问题或直接极小化问题。最广泛使用的方法来解决前者是所谓的自洽场(SCF)迭代。一个共同的观察是,SCF的收敛性在理论上是不明确的,而解决后者的收敛性保证的方法往往不是SCF数值竞争力。在本文中,我们研究了梯度型方法,通过构造新的迭代沿梯度的Stiefel流形上的直接极小化问题。全局收敛(即,从任何初始解收敛到一个稳定点)以及局部收敛速度直接从流形上优化的标准理论得出。一个主要的计算优势是不再需要计算线性特征值问题。我们的方法的主要成本来自总能量泛函及其梯度的组装和到流形上的投影。这些任务比特征值计算更便宜,并且它们通常更适合并行化,只要总能量泛函及其梯度的评估是有效的。数值结果表明,他们可以优于SCF一致的许多实际大系统。

英文摘要:

The density functional theory (DFT) in electronic structure calculations can be formulated as either a nonlinear eigenvalue or direct minimization problem. The most widely used approach for solving the former is the so-called self-consistent field (SCF) iteration. A common observation is that the convergence of SCF is not clear theoretically while approaches with convergence guarantee for solving the latter are often not competitive to SCF numerically. In this paper, we study gradient type methods for solving the direct minimization problem by constructing new iterations along the gradient on the Stiefel manifold. Global convergence (i.e., convergence to a stationary point from any initial solution) as well as local convergence rate follows from the standard theory for optimization on manifold directly. A major computational advantage is that the computation of linear eigenvalue problems is no longer needed. The main costs of our approaches arise from the assembling of the total energy functional and its gradient and the projection onto the manifold. These tasks are cheaper than eigenvalue computation and they are often more suitable for parallelization as long as the evaluation of the total energy functional and its gradient is efficient. Numerical results show that they can outperform SCF consistently on many practically large systems.

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

↑