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

93Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Cancès, E., & Le Bris, C. (2000). On the convergence of scf algorithms for the Hartree-Fock equations. Mathematical Modelling and Numerical Analysis, 34(4), 749–774. https://doi.org/10.1051/m2an:2000102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free