Abstract (EN)

The numerical solution of the Hartree-Fock equations is a central problem in quantum chemistry for which many algorithms exist. Attempts to justify these algorithms mathematically have been made, notably by Cancès and Le Bris in 2000, but no algorithm has yet been proved to convergence satisfactorily. In this paper, we prove the convergence of a natural gradient algorithm, using a gradient inequality for analytic functionals due to Lojasiewicz. Then, expanding upon the analysis of Cancès and Le Bris, we prove convergence results for the Roothaan and Level-Shifting algorithms. In each case, our method of proof provides estimates on the convergence rate. We compare these with numerical results for the algorithms studied.