A parallel full configuration interaction FCI code, implemented on a distributed memory MPP computer, has been modified in order to use a direct algorithm to compute the lists of mono-and biexcitations each time they are needed. We were able to perform FCI calculations on the ground state of the ace
โฆ LIBER โฆ
A new direct MP2 gradient algorithm with implementation on a massively parallel computer
โ Scribed by Ida M.B. Nielsen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 464 KB
- Volume
- 255
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
A new direct second-order Moller-Plesset gradient algorithm is presented. By avoiding generation of molecular orbital integrals with three virtual indices, the memory requirement for a calculation with n basis functions and o occupied orbitals is reduced to on 2, and overall computational savings are obtained. The algorithm has been implemented with distributed data on a massively parallel computer, the Intel Paragon. The parallelization scheme provides high parallel efficiency, and the performance of the algorithm is illustrated for calculations running on up to 64 processors.
๐ SIMILAR VOLUMES
Full configuration interaction algorithm
โ
Rossi, Elda; Bendazzoli, Gian Luigi; Evangelisti, Stefano
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 984 KB