Efficient Parallel Implementation of a Full Configuration Interaction Algorithm for Circular Polyenes On a Cray Y-Mp
- 1 December 1992
- journal article
- Published by SAGE Publications in The International Journal of Supercomputing Applications
- Vol. 6 (4) , 351-360
- https://doi.org/10.1177/109434209200600404
Abstract
An efficient implementation on the CRAY Y-MP of a new full configuration interaction algorithm is illus trated on a model problem. This shows how a careful optimization can lead to huge speedups in CPU times and interesting speedups in the overall elapsed times. The implementation takes full advantage of the algo rithm's characteristics, with a full vectorization of the heaviest innermost loops and parallelization of the im mediately outer loops.Keywords
This publication has 19 references indexed in Scilit:
- Effective Hamiltonians for extended systems: cyclic polyenes in the PPP approximationChemical Physics Letters, 1992
- Full-CI calculations of alternant cyclic polyenes (CH)N, N=2, 4, 6, ƒ 18, in the PPP approximationChemical Physics Letters, 1991
- Passing the one-billion limit in full configuration-interaction (FCI) calculationsChemical Physics Letters, 1990
- Unlimited full configuration interaction calculationsThe Journal of Chemical Physics, 1989
- An efficient implementation of the full-CI method using an (n–2)-electron projection spaceChemical Physics Letters, 1989
- Very large full configuration interaction calculationsChemical Physics Letters, 1989
- Determinant based configuration interaction algorithms for complete and restricted configuration interaction spacesThe Journal of Chemical Physics, 1988
- Multi-root configuration interaction calculationsChemical Physics Letters, 1980
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975
- Derivation and Analysis of the Pariser–Parr–Pople ModelThe Journal of Chemical Physics, 1968