Table of Content

Open Access iconOpen Access

ABSTRACT

A Linearly Constrained Least-Squares Problem in \\ Electronic Structure Computations

Peng Ni1, Homer Walker1

Worcester Polytechnic Institute, Worcester, MA 01609 USA.

The International Conference on Computational & Experimental Engineering and Sciences 2008, 7(1), 43-50. https://doi.org/10.3970/icces.2008.007.043

Abstract

One of the fundamental problems in electronic structure calculations is to determine the electron density associated with the minimum total energy of a molecular or bulk system. The total energy minimization problem is often formulated as a nonlinear eigenvalue problem. The most widely used algorithm for solving this type of problem is the self-consistent field (SCF) iteration accelerated by Direct Inversion on the Iterative Subspace (SCF-DIIS), in which a linearly constrained least-squares problem is embedded. We will examine and compare the numerical stability of three different ways to solve this least-squares problem.

Cite This Article

APA Style
Ni, P., Walker, H. (2008). A linearly constrained least-squares problem in \\ electronic structure computations. The International Conference on Computational & Experimental Engineering and Sciences, 7(1), 43-50. https://doi.org/10.3970/icces.2008.007.043
Vancouver Style
Ni P, Walker H. A linearly constrained least-squares problem in \\ electronic structure computations. Int Conf Comput Exp Eng Sciences . 2008;7(1):43-50 https://doi.org/10.3970/icces.2008.007.043
IEEE Style
P. Ni and H. Walker, "A Linearly Constrained Least-Squares Problem in \\ Electronic Structure Computations," Int. Conf. Comput. Exp. Eng. Sciences , vol. 7, no. 1, pp. 43-50. 2008. https://doi.org/10.3970/icces.2008.007.043



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 937

    View

  • 715

    Download

  • 0

    Like

Share Link