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

153 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Numerical Solution of the Hartree - Fock Equation in Multilevel Tensor-Structured Format (2011, methodology): “In this paper the SCF iteration is the traditional direct inversion in the iterative subspace (DIIS) scheme commonly used in the physical literature [30, 15, 3].”
Numerical approximations of a nonlinear eigenvalue problem and applications to a density functional model (2010, unknown): “[11, 12, 32]).”
Numerical solution of the Hartree-Fock equation by multilevel tensor-structured methods (2011, unknown): “The multilevel acceleration of DIIS iteration described in Section 5.2.3 leads to stable and fast convergence on fine grid levels.”
Tensors-structured Numerical Methods in Scientific Computing: Survey on Recent Advances (2012, methodology): “In this case, instead of truncated preconditioned inverse iteration, one can employ the Struncated Krylov subspace-type iteration (the so-called DIIS iteration [9, 82]) applied to the Galerkin system in the problem adapted basis, (see [58]), leading to the numerical cost O(N logN).”