skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver

Abstract

We describe a number of recently developed techniques for improving the performance of large-scalenuclear configuration interaction calculations on high performance parallel computers. We show thebenefit of using a preconditioned block iterative method to replace the Lanczos algorithm that hastraditionally been used to perform this type of computation. The rapid convergence of the block iterativemethod is achieved by a proper choice of starting guesses of the eigenvectors and the construction of aneffective preconditioner. These acceleration techniques take advantage of special structure of the nuclearconfiguration interaction problem which we discuss in detail. The use of a block method also allows usto improve the concurrency of the computation, and take advantage of the memory hierarchy of modernmicroprocessors to increase the arithmetic intensity of the computation relative to data movement. Wealso discuss the implementation details that are critical to achieving high performance on massivelyparallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to threetimes faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

Authors:
ORCiD logo [1];  [2];  [1];  [1];  [3];  [3]
  1. Lawrence Berkeley National Laboratory. (LBNL), Berkeley, CA (United States). Computational Research Division
  2. Michigan State University, East Lansing, MI (United States). Department of Computer Science and Engineering
  3. Iowa State University, Ames, IA (United States). Department of Physics and Astronomy
Publication Date:
Research Org.:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
OSTI Identifier:
1463273
DOE Contract Number:  
DESC0008485; FG02-87ER40371; AC02-05CH11231
Resource Type:
Journal Article
Journal Name:
Computer Physics Communications
Additional Journal Information:
Journal Volume: 222; Journal Issue: C; Journal ID: ISSN 0010-4655
Country of Publication:
United States
Language:
English

Citation Formats

Shao, Meiyue, Aktulga, H.  Metin, Yang, Chao, Ng, Esmond G., Maris, Pieter, and Vary, James P. Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver. United States: N. p., 2018. Web. doi:10.1016/j.cpc.2017.09.004.
Shao, Meiyue, Aktulga, H.  Metin, Yang, Chao, Ng, Esmond G., Maris, Pieter, & Vary, James P. Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver. United States. https://doi.org/10.1016/j.cpc.2017.09.004
Shao, Meiyue, Aktulga, H.  Metin, Yang, Chao, Ng, Esmond G., Maris, Pieter, and Vary, James P. 2018. "Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver". United States. https://doi.org/10.1016/j.cpc.2017.09.004.
@article{osti_1463273,
title = {Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver},
author = {Shao, Meiyue and Aktulga, H.  Metin and Yang, Chao and Ng, Esmond G. and Maris, Pieter and Vary, James P.},
abstractNote = {We describe a number of recently developed techniques for improving the performance of large-scalenuclear configuration interaction calculations on high performance parallel computers. We show thebenefit of using a preconditioned block iterative method to replace the Lanczos algorithm that hastraditionally been used to perform this type of computation. The rapid convergence of the block iterativemethod is achieved by a proper choice of starting guesses of the eigenvectors and the construction of aneffective preconditioner. These acceleration techniques take advantage of special structure of the nuclearconfiguration interaction problem which we discuss in detail. The use of a block method also allows usto improve the concurrency of the computation, and take advantage of the memory hierarchy of modernmicroprocessors to increase the arithmetic intensity of the computation relative to data movement. Wealso discuss the implementation details that are critical to achieving high performance on massivelyparallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to threetimes faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.},
doi = {10.1016/j.cpc.2017.09.004},
url = {https://www.osti.gov/biblio/1463273}, journal = {Computer Physics Communications},
issn = {0010-4655},
number = C,
volume = 222,
place = {United States},
year = {Mon Jan 01 00:00:00 EST 2018},
month = {Mon Jan 01 00:00:00 EST 2018}
}

Works referenced in this record:

Ab initio no core shell model
journal, March 2013


An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
journal, October 1950


Improving the scalability of a symmetric iterative eigensolver for multi-core platforms: IMPROVING THE SCALABILITY OF A SYMMETRIC ITERATIVE EIGENSOLVER
journal, September 2013


Minimization Principles for the Linear Response Eigenvalue Problem II: Computation
journal, January 2013


Adaptively Compressed Exchange Operator for Large-Scale Hybrid Density Functional Calculations with Applications to the Adsorption of Water on Silicene
journal, February 2017


An indefinite variant of LOBPCG for definite matrix pencils
journal, August 2013


Factorization in large-scale many-body calculations
journal, December 2013


The Shell-Model Code NuShellX@MSU
journal, June 2014


A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations
journal, June 2017


Methods of conjugate gradients for solving linear systems
journal, December 1952


A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
journal, April 1996


Convergence Theory for Preconditioned Eigenvalue Solvers in a Nutshell
journal, November 2015


A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient
journal, January 2001


A geometric theory forpreconditioned inverse iterationII: Convergence estimates
journal, January 2001


Krylov subspace methods for solving large unsymmetric linear systems
journal, September 1981


GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
journal, July 1986


Reducing the profile of sparse symmetric matrices
journal, December 1976


Basis selection in LOBPCG
journal, October 2006


Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
journal, January 2001


An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
journal, October 1950


Methods of conjugate gradients for solving linear systems
journal, December 1952


Works referencing / citing this record:

Few- and many-nucleon systems with semilocal coordinate-space regularized chiral two- and three-body forces
journal, February 2019


Effective interactions in the s d shell
journal, November 2019


Effective interactions in the sd shell
text, January 2019


Model Order Reduction Algorithm for Estimating the Absorption Spectrum
journal, September 2017