论文信息 - Reducing I/O costs for the eigenvalue procedure in large‐scale configuration interaction calculations

Reducing I/O costs for the eigenvalue procedure in large‐scale configuration interaction calculations

Several aspects of the matrix diagonalization method used for CI calculations in the COLUMBUS Program System are discussed, including a linear basis‐contraction algorithm and the use of a nonorthogonal expansion basis. Both of these features significantly reduce the I/O requirements during the iterations. © 2002 Wiley Periodicals, Inc. J Comput Chem 23: 1121–1125, 2002

[1] Russell M. Pitzer,et al. A progress report on the status of the COLUMBUS MRCI program system , 1988 .

[2] Robert J. Harrison,et al. Multireference Configuration Interaction Calculations on Cr2: Passing the One Billion Limit in MRCI/MRACPF Calculations , 1999 .

[3] H. Lischka,et al. Excitation energies and transition moments by the multireference averaged quadratic coupled cluster (MR-AQCC) method , 2000 .

[4] R. Pitzer,et al. Electronic Spectrum of the NpO22+ and NpO2+ Ions , 2000 .

[5] E. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .

[6] Robert J. Harrison,et al. A massively parallel multireference configuration interaction program: The parallel COLUMBUS program , 1997 .

[7] Thomas Müller,et al. High-level multireference methods in the quantum-chemistry program system COLUMBUS: Analytic MR-CISD and MR-AQCC gradients and MR-AQCC-LRT for excited states, GUGA spin–orbit CI and parallel CI density , 2001 .

[8] Matthew L. Leininger,et al. Systematic Study of Selected Diagonalization Methods for Configuration Interaction Matrices , 2001, J. Comput. Chem..

[9] William J. Thompson,et al. Monster Matrices: Their Eigenvalues and Eigenvectors , 1993 .