Stochastic Algorithms for Self-consistent Calculations of Electronic Structures
arXiv:2107.01454 · doi:10.1090/mcom/3826
Abstract
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.
References in corpus (11)
- SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
- Deep neural network solution of the electronic Schrödinger equation
- Real-Space Mesh Techniques in Density Functional Theory
- Stochastic Variance Reduction for Nonconvex Optimization
- Periodic Pulay method for robust and efficient convergence acceleration of self-consistent field iterations
- SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient
- Stochastic Density Functional Theory at Finite Temperatures
- An Efficient and Robust Technique for Achieving Self Consistency in Electronic Structure Calculations
- Random Batch Algorithms for Quantum Monte Carlo simulations
- Fast computation of spectral densities for generalized eigenvalue problems
- Elliptic preconditioner for accelerating the self consistent field iteration in Kohn-Sham density functional theory