2003
DOI: 10.1063/1.1578621
|View full text |Cite
|
Sign up to set email alerts
|

Reduced scaling in electronic structure calculations using Cholesky decompositions

Abstract: We demonstrate that substantial computational savings are attainable in electronic structure calculations using a Cholesky decomposition of the two-electron integral matrix. In most cases, the computational effort involved calculating the Cholesky decomposition is less than the construction of one Fock matrix using a direct O(N 2 ) procedure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
450
0

Year Published

2004
2004
2016
2016

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 438 publications
(451 citation statements)
references
References 5 publications
1
450
0
Order By: Relevance
“…As mentioned in Ref. 1, Cholesky decomposition of the integral matrix is formally similar to the socalled resolution-of-identity ͑RI͒ ͑Refs. 3 and 4͒ or density-fitting ͑DF͒ ͑Ref.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…As mentioned in Ref. 1, Cholesky decomposition of the integral matrix is formally similar to the socalled resolution-of-identity ͑RI͒ ͑Refs. 3 and 4͒ or density-fitting ͑DF͒ ͑Ref.…”
Section: Introductionmentioning
confidence: 99%
“…First, M equals the minimum number of columns of the integral matrix that need to be calculated during the decomposition, although the number actually calculated usually is somewhat larger, as the integrals are calculated in shell-pair distributions. 1 Second, if sparsity is not employed, M directly determines the operation count for a subsequent electronic structure calculation. An integral-direct Cholesky decomposition algorithm is presented in Ref.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations