Accelerating configuration interaction calculations for nuclear structure

ABSTRACT

One of the emerging computational approaches in nuclear physics is the configuration interaction (CI) method for solving the many-body nuclear Hamiltonian in a sufficiently large single-particle basis space to obtain exact answers - either directly or by extrapolation. The lowest eigenvalues and corresponding eigenvectors for very large, sparse and unstructured nuclear Hamiltonian matrices are obtained and used to evaluate additional experimental quantities. These matrices pose a significant challenge to the design and implementation of efficient and scalable algorithms for obtaining solutions on massively parallel computer systems. In this paper, we describe the computational strategies employed in a state-of-the-art CI code MFDn (Many Fermion Dynamics - nuclear) as well as techniques we recently developed to enhance the computational efficiency of MFDn. We will demonstrate the current capability of MFDn and report the latest performance improvement we have achieved. We will also outline our future research directions.

REFERENCES

• 1: Iain S. Duff, R. G. Grimes, and J. G. Lewis. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1). Technical Report RAL 92--086, CERFACS, Chilton, Oxon, England, 1992.
• 2: Z. Gan, Y. Alexeev, M. S. Gordon, R. A. Kendall. The parallel implementation of a full configuration interaction program. J. Chem. Phys., 119:47--59, 2003.
• 3: Andrew V. Knyazev, Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method, SIAM Journal on Scientific Computing, v.23 n.2, p.517-541, 2001 [doi>10.1137/S1064827500366124]
• 4: R. B. Lehoucq, D. C. Sorensen, P. Vu, and C. Yang. ARPACK: An implementation of the Implicitly Re-started Arnoldi Iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix, 1995. Available from ftp.caam.rice.edu under the directory pub/software/ARPACK.
• 5: R. B. Lehoucq, D. C. Sorensen, and C. Yang. ARPACK USERS GUIDE: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia, PA, 1998.
• 6: Beresford N. Parlett, The symmetric eigenvalue problem, Prentice-Hall, Inc., Upper Saddle River, NJ, 1998
• 7: E. Rossi, G. L. Bendazzoli, and S. Evangelisti. Full configuration interaction algorithm on a massively parallel architecture: Direct-list implementation J. Comp. Chem., 19(6):658:672, 1998.
• 8: D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM Journal on Matrix Analysis and Applications, v.13 n.1, p.357-385, Jan. 1992 [doi>10.1137/0613025]
• 9: J. P. Vary. The many-fermion dynamics shell-model code, 1992. unpublished.
• 10: J. P. Vary and D. C. Zheng. The many-fermion dynamics shell-model code, ibid., 1994. unpublished.
• 11: S. Wong. Introductory Nuclear Physics. Prentice-Hall, Englewood Cliffs, NJ., 1990.

INDEX TERMS

Primary Classification:
  J. Computer Applications
  J.2 PHYSICAL SCIENCES AND ENGINEERING
      Subjects: Physics

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems

General Terms:
Algorithms, Design, Experimentation, Measurement, Performance