Two-electron integrals can be decomposed using Cholesky
decomposition
357
J. Chem. Phys.
(2013),
139,
pp. 134105.
Link
,
372
J. Chem. Phys.
(2019),
151,
pp. 014110.
Link
giving rise to the same representation as in
RI and substantially reducing the cost of integral transformation, disk storage
requirements, and improving parallel performance:
| (6.73) |
The rank of Cholesky decomposition, , is typically 3-10 times larger than
the number of basis functions (Ref.
49
Theor. Chem. Acc.
(2009),
124,
pp. 1.
Link
); it
depends on the decomposition threshold and is considerably smaller
than the full rank of the matrix,
(Refs.
49
Theor. Chem. Acc.
(2009),
124,
pp. 1.
Link
,
102
Int. J. Quantum Chem.
(1977),
12,
pp. 683.
Link
,
1425
Comput. Phys. Commun.
(1990),
58,
pp. 71–81.
Link
).
Cholesky decomposition removes linear dependencies in product
densities ,
49
Theor. Chem. Acc.
(2009),
124,
pp. 1.
Link
allowing one to obtain compact
approximation to the original matrix with accuracy, in principle, up to machine
precision.
Decomposition threshold is the only parameter that controls accuracy and the rank of the decomposition. Cholesky decomposition is invoked by specifying CHOLESKY_TOL that defines the accuracy with which decomposition should be performed. For most calculations tolerance of gives a good balance between accuracy and compactness of the rank. Tolerance of can be used for exploratory calculations and for high-accuracy calculations. Similar to RI, Cholesky-decomposed integrals can be transformed back, into the canonical MO form, using CC_DIRECT_RI keyword.
The default execution uses the old algorithm for the decomposition
357
J. Chem. Phys.
(2013),
139,
pp. 134105.
Link
,
372
J. Chem. Phys.
(2019),
151,
pp. 014110.
Link
,
which is not the most effective, especially when gradients are computed. A
more effective two-step decomposition reduces the cost of this step. It can be
invoked by setting CHOLESKY_TWOSTEP=TRUE and
specifying CD_TS_SPAN_FACTOR, as illustrated in example 6.12.12.