By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Scientific Computing

Previous Article
A Greedy Strategy for Coarse-Grid Selection
Efficient solution of the very large linear systems that arise in numerical modeling of real-world applications is often only possible through the use of multilevel techniques. While highly optimized...
Next Article
Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration
We consider a preconditioned Krylov subspace iterative algorithm presented by Faul, Goodsell, and Powell (IMA J. Numer. Anal. 25 (2005), pp. 1–24) for computing the coefficients of a radial bas...

You are not logged in to this journal. Log in

A Trust Region Direct Constrained Minimization Algorithm for the Kohn–Sham Equation

SIAM J. Sci. Comput. Volume 29, Issue 5, pp. 1854-1875 (2007)

Published September 28, 2007
Buy This PDF   (US$25)
Download PDF (248 kB) View Cart

The self-consistent field (SCF) iteration, widely used for computing the ground state energy and the corresponding single particle wave functions associated with a many-electron atomistic system, is viewed in this paper as an optimization procedure that minimizes the Kohn–Sham (KS) total energy indirectly by minimizing a sequence of quadratic surrogate functions. We point out the similarity and difference between the total energy and the surrogate, and show how the SCF iteration can fail when the minimizer of the surrogate produces an increase in the KS total energy. A trust region technique is introduced as a way to restrict the update of the wave functions within a small neighborhood of an approximate solution at which the gradient of the total energy agrees with that of the surrogate. The use of trust regions in SCF is not new. However, it has been observed that directly applying a trust region-based SCF (TRSCF) to the KS total energy often leads to slow convergence. We propose to use TRSCF within a direct constrained minimization (DCM) algorithm we developed in [J. Comput. Phys., 217 (2006), pp. 709–721]. The key ingredients of the DCM algorithm involve projecting the total energy function into a sequence of subspaces of small dimensions and seeking the minimizer of the total energy function within each subspace. The minimizer of a subspace energy function, which is computed by the TRSCF, not only provides a search direction along which the KS total energy function decreases, but also gives an optimal “step length" that yields a sufficient decrease in total energy. A numerical example is provided to demonstrate that the combination of TRSCF and DCM is more efficient than SCF.

©2007 Society for Industrial and Applied Mathematics
History: Received May 30, 2006; accepted October 24, 2006; published September 28, 2007
Permalink: http://dx.doi.org/10.1137/060661442

KEYWORDS and AMS

Keywords
AMS Subject Classifications
15A18, 65K10, 65F15

PUBLICATION DATA

ISSN:
1064-8275 (print)   1095-7197 (online)
Publisher:
AIP is a member of CrossRef SIAM

REFERENCES (36)

For access to fully linked references, you need to log in. For access to fully linked references, you need to Log in.

CITING ARTICLES

For access to citing articles, you need to log in.
For access to citing articles, you need to Log in.