2008
DOI: 10.1063/1.2841077
|View full text |Cite
|
Sign up to set email alerts
|

Direct energy functional minimization under orthogonality constraints

Abstract: The direct energy functional minimization problem in electronic structure theory, where the single-particle orbitals are optimized under the constraint of orthogonality, is explored. We present an orbital transformation based on an efficient expansion of the inverse factorization of the overlap matrix that keeps orbitals orthonormal. The orbital transformation maps the orthogonality constrained energy functional to an approximate unconstrained functional, which is correct to some order in a neighborhood of an … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
89
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 65 publications
(89 citation statements)
references
References 45 publications
(37 reference statements)
0
89
0
Order By: Relevance
“…[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18] Development of linear-scaling techniques, in particular for excited states, remains an active area of electronic structure theory. With sparse matrix techniques, linear-scaling calculations can be achieved by means of DAC-style fragment methods, localized molecular orbitals (LMOs), and density matrices.…”
Section: Introductionmentioning
confidence: 99%
“…[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18] Development of linear-scaling techniques, in particular for excited states, remains an active area of electronic structure theory. With sparse matrix techniques, linear-scaling calculations can be achieved by means of DAC-style fragment methods, localized molecular orbitals (LMOs), and density matrices.…”
Section: Introductionmentioning
confidence: 99%
“…The basic idea of computing just K iν or, for that matter, just F iν is of course extremely simple and undoubtedly has been thought of before. It has been employed in the iterative updates of plane-wave DFT calculations, 60 where the full Fock matrix is enormous and thus, evaluating a narrow rectangular matrix is far preferable to an enormous square matrix. Indeed, the idea of constructing this economized version of K was mentioned briefly by Aquilante et al, 61 but we have found no prior or subsequent discussion in the literature.…”
Section: A Economization Of the K Matrixmentioning
confidence: 99%
“…To demonstrate the computational efficiency of the ALMO methods their performance is compared to that of the orbital transformation (OT) approach 47,48 . OT is a highly efficient and well-optimized SCF algorithm that performs PCG optimization of the occupied MOs.…”
Section: Resultsmentioning
confidence: 99%