We present a method for the direct generation of the lists of Ž . strings, suited for integral-driven full-CI FCI algorithms. This method generates the string lists each time they are used, and hence sensibly reduces the memory requirements, compared to our previous method that precalculates the lis
Perspective: Björn Roos and direct configuration interaction
✍ Scribed by Isaiah Shavitt
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 64 KB
- Volume
- 111
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The introduction, impact, and development of the direct configuration interaction (CI) approach are reviewed. The removal of the limitation on the size of CI calculation by eliminating the need to store the Hamiltonian matrix and the streamlining of the calculation of the eigenvector updates in each iteration are seen to be the key transformative contributions of this approach. The initial introduction, limited to closed‐shell single‐reference CISD (CI with single and double excitations) calculations, underwent successive generalizations, culminating in procedures based on the graphical unitary group approach, allowing applications to multireference CISD calculations for any electronic state. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem 111:3263–3266, 2010
📜 SIMILAR VOLUMES
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
## Abstract The configuration interaction method where a single reference state is composed of a linear combination of reference configurations is analyzed in detail. In this method single and double replacements are constructed by applying annihilation and creation operators on the reference state