1981
DOI: 10.1088/0031-9112/32/7/001
|View full text |Cite
|
Sign up to set email alerts
|

Comparing theories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

1995
1995
2007
2007

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(17 citation statements)
references
References 0 publications
0
17
0
Order By: Relevance
“…To minimize E SIC by the steepest descent method [50], we imagine having in the mth iteration the set of orbitals ψ (m) α , which satisfy Eq. (9) but do not yet minimize E SIC , the orbitals of the (m + 1)th iteration are defined by stepping along the gradient of E SIC :…”
Section: Minimization Of Sic-lsd Energy Functionalmentioning
confidence: 99%
“…To minimize E SIC by the steepest descent method [50], we imagine having in the mth iteration the set of orbitals ψ (m) α , which satisfy Eq. (9) but do not yet minimize E SIC , the orbitals of the (m + 1)th iteration are defined by stepping along the gradient of E SIC :…”
Section: Minimization Of Sic-lsd Energy Functionalmentioning
confidence: 99%
“…In the plane-wave basis set we use in the examples, this amounts to including the kinetic part of the Hamiltonian and the average value of the effective potential. The algorithm introduced by Williams and Soler 15 can be generalized to solve Eq. ͑16͒ iteratively.…”
Section: ͑16͒mentioning
confidence: 99%
“…The optimal decomposition is one which is neither purely spatial nor purely orbital, but a combination of the two. [32] which, while very similar to CP, is not identical.…”
Section: F Parallel Algorithm For Rhoofrmentioning
confidence: 85%