A sparse matrix based full-configuration interaction algorithm

Research output: Article

22 Citations (Scopus)


We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers.

Original languageEnglish
Article number144101
JournalJournal of Chemical Physics
Issue number14
Publication statusPublished - ápr. 24 2008

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Physical and Theoretical Chemistry

Fingerprint Dive into the research topics of 'A sparse matrix based full-configuration interaction algorithm'. Together they form a unique fingerprint.

  • Cite this