메뉴 건너뛰기




Volumn 118, Issue 14, 2003, Pages 6144-6151

Curvy steps for density matrix-based energy minimization: Application to large-scale self-consistent-field calculations

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ATOMS; CALCULATIONS; HAMILTONIANS; HYDROGEN BONDS; MATRIX ALGEBRA; ONE DIMENSIONAL; OPTIMIZATION; PARAFFINS; PURIFICATION; TWO DIMENSIONAL; WATER;

EID: 0037961619     PISSN: 00219606     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.1558476     Document Type: Article
Times cited : (60)

References (53)
  • 38
    • 0037668473 scopus 로고    scopus 로고
    • note
    • As pointed out by Helgaker, Larsen, Olsen, and Jørgensen in Ref. 40, one can also parameterize the Hartree-Fock/Kohm-Sham energy this way, leading to a diagonalization-free approach. Here the most desirable minimization method is BFGS, because it does not require extra Fock builds to find the next step direction. But parallel transport of previous gradient and step vectors is not quite straightforward even though its MO counterpart was already developed in Refs. 31 and 32.
  • 45
    • 0038006188 scopus 로고    scopus 로고
    • note
    • As pointed out be Challacombe in Ref. 37, the inverse overlap matrix is itself dense, but one can avoid building it explicitly by using the inverse Cholesky factor, Z, which is not dense.
  • 47
    • 0038682796 scopus 로고    scopus 로고
    • Version 2.0, Department of Computer Science and Engineering, University of Minnesota; (unpublished)
    • Y. Saad, Version 2.0, Department of Computer Science and Engineering, University of Minnesota, http://www.cs.umn.edu/Research/arpa/SPARSKIT/sparskit.html (unpublished).
    • Saad, Y.1
  • 53
    • 0038682799 scopus 로고    scopus 로고
    • note
    • We believe the explanation for why Ref. 41 required projection of redundant variables and our approach does not is not because of our use of an orthogonal basis, vs the nonorthogonal basis of Ref. 41. In an orthogonal basis, there is no distinction between covariant and contravariant vectors, and thus a covariant gradient can automatically be converted into a contravariant step which has no component in the occupied-occupied or virtual-virtual spaces. This applies either to steepest descent or to a full Newton step. It is no longer exactly true when cutoffs are applied or when a level shift is added to the Hessian. However, the latter is only done far from convergence. By contrast, in a nonorthogonal basis, when the inverse metric is not used to convert covariant vectors to contravariant, even a steepest descent step will have artificial components in the occupied-occupied and virtual-virtual spaces, because such a step is not tensorially correct.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.