Convergence of gradient-based algorithms for the Hartree-Fock equations

Details Convergence of gradient-based algorithms for the Hartree-Fock equations Convergence of gradient-based algorithms for the Hartree-Fock equations

2011-09-26

arxiv.org/abs/1109.5473v2

Physics

Mathematical Physics

Scientific paper

The numerical solution of the Hartree-Fock equations is a central problem in quantum chemistry for which numerous algorithms exist. Attempts to justify these algorithms mathematically have been made, notably in by Cances and Le Bris in 2000, but, to our knowledge, no complete convergence proof has been published. 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 Cances 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.

Affiliated with

Also associated with

No associations

Rating

Convergence of gradient-based algorithms for the Hartree-Fock equations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence of gradient-based algorithms for the Hartree-Fock equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of gradient-based algorithms for the Hartree-Fock equations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688468