## 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 electronic 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 that the iterates from a general linear mixing scheme converge in a probabilistic sense when the stochastic error has a second finite moment.

Original language | English (US) |
---|---|

Pages (from-to) | 1693-1728 |

Number of pages | 36 |

Journal | Mathematics of Computation |

Volume | 92 |

Issue number | 342 |

DOIs | |

State | Published - Jul 2023 |

## All Science Journal Classification (ASJC) codes

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics