Direct Minimization for Calculating Invariant Subspaces in Density Functional Computations of the Electronic Structure

Author(s)

Abstract

In this article, we analyse three related preconditioned steepest descent algorithms, which are partially popular in Hartree-Fock and Kohn-Sham theory as well as invariant subspace computations, from the viewpoint of minimization of the corresponding functionals, constrained by orthogonality conditions. We exploit the geometry of the admissible manifold, i.e., the invariance with respect to unitary transformations, to reformulate the problem on the Grassmann manifold as the admissible set. We then prove asymptotical linear convergence of the algorithms under the condition that the Hessian of the corresponding Lagrangian is elliptic on the tangent space of the Grassmann manifold at the minimizer.

About this article

Abstract View

  • 33416

Pdf View

  • 3594

How to Cite

Direct Minimization for Calculating Invariant Subspaces in Density Functional Computations of the Electronic Structure. (2018). Journal of Computational Mathematics, 27(2-3), 360-387. https://www.global-sci.com/index.php/JCM/article/view/11941