Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T16:23:40.582Z Has data issue: false hasContentIssue false

On the convergence of SCF algorithmsfor the Hartree-Fock equations

Published online by Cambridge University Press:  15 April 2002

Eric Cancès
Affiliation:
CERMICS, École Nationale des Ponts et Chaussées, 6 et 8 avenue Pascal, Cité Descartes, 77455 Champs-sur-Marne Cedex 2, France. (cances@cermics.enpc.fr)
Claude Le Bris
Affiliation:
CERMICS, École Nationale des Ponts et Chaussées, 6 et 8 avenue Pascal, Cité Descartes, 77455 Champs-sur-Marne Cedex 2, France. (lebris@cermics.enpc.fr)
Get access

Abstract

The present work is a mathematical analysis of two algorithms, namelythe Roothaan and the level-shifting algorithms, commonly used inpractice to solve the Hartree-Fock equations. The level-shiftingalgorithm is proved to be well-posed and to converge provided the shiftparameter is large enough. On the contrary, cases when the Roothaanalgorithm is not well defined or fails in converging areexhibited. These mathematical results are confronted to numericalexperiments performed by chemists.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable