On the convergence of scf algorithms for the Hartree-Fock equations

The present work is a mathematical analysis of two algorithms, namely the Roothaan and the level-shifting algorithms, commonly used in practice to solve the Hartree-Fock equations. The level-shifting algorithm is proved to be well-posed and to converge provided the shift parameter is large enough. On the contrary, cases when the Roothaan algorithm is not well defined or fails in converging are exhibited. These mathematical results are confronted to numerical experiments performed by chemists.