1986
DOI: 10.1063/1.450106
|View full text |Cite
|
Sign up to set email alerts
|

Efficient recursive computation of molecular integrals over Cartesian Gaussian functions

Abstract: Recurrence expressions are derived for various types of molecular integrals over Cartesian Gaussian functions by the use of the recurrence formula for three-center overlap integrals. A number of characteristics inherent in the recursive formalism allow an efficient scheme to be developed for molecular integral computations. With respect to electron repulsion integrals and their derivatives, the present scheme with a significant saving of computer time is found superior to other currently available methods. A l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
429
0
3

Year Published

1996
1996
2012
2012

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 652 publications
(433 citation statements)
references
References 21 publications
1
429
0
3
Order By: Relevance
“…(15)] is added to Eq. (18) or (21). On the other hand, when hybrid functionals are not used, there is no need to compute Eq.…”
Section: Kohn-sham Dftmentioning
confidence: 99%
See 3 more Smart Citations
“…(15)] is added to Eq. (18) or (21). On the other hand, when hybrid functionals are not used, there is no need to compute Eq.…”
Section: Kohn-sham Dftmentioning
confidence: 99%
“…[21] ERIs. are computed with the libint library [46] that uses Obara-Saika [21] and Head-Gordon-Pople recursions.…”
Section: Formation Of Matricesmentioning
confidence: 99%
See 2 more Smart Citations
“…12 Since Boys' seminal work, numerous computational approaches have been developed to minimize the effort in this N 4 bottleneck. [13][14][15][16][17] However, even if the most efficient algorithm is being used, the twoelectron integral evaluation phase still takes much of the computation time.…”
Section: Two-electron Repulsion Integralsmentioning
confidence: 99%