ISSN:
0020-7608
Keywords:
Computational Chemistry and Molecular Modeling
;
Atomic, Molecular and Optical Physics
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Chemistry and Pharmacology
Notes:
When viewed as a square two-indexed matrix, the array of atomic orbital-based, two-electron integrals (ij|kl) is a positive semidefinite array. Beebe and Linderberg showed, in 1977, that actual or near linear dependencies often exist within the types of atomic orbital basis sets employed in conventional quantum chemical calculations. In fact, large (i.e., higher quality) bases were shown to be substantially more redundant than smaller or more spatially separated bases. In situations where there exists significant basis near redundancy, the rank (r) of the (ij|kl) ≡ Vl,J matrix of integrals will be significantly smaller than the matrix dimension M. When this occurs, it proves computationally tractable to decompose the M-dimensional matrix V into components L (V = LLT) which contain all of the information needed to form the full V matrix. The Cholesky algorithm allow such a decomposition to be carried out and forms the basis of the work described here. The method is found to be highly successful in reducing the number of integrals and integral derivatives that must actually be calculated. In particular, results on the C2 molecule indicate that the algorithm can be superior to traditional methods of integral derivative generation if the orbital basis is large enough to contain appreciable near redundancy. In contrast, results on benzene with a more spatially delocalized basis show that conventional methods are preferred whenever substantial basis (near) redundancy is not present.
Additional Material:
8 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/qua.560360602
