Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Journal Article · · Journal of Computational Physics
 [1];  [2];  [3];  [1];  [3];  [1]
  1. Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
  2. Michigan State Univ., East Lansing, MI (United States)
  3. Iowa State Univ., Ames, IA (United States)

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

Research Organization:
Michigan State Univ., East Lansing, MI (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Nuclear Physics (NP); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR). Scientific Discovery through Advanced Computing (SciDAC)
Grant/Contract Number:
SC0024586; SC0023495; SC0023175; AC02-05CH11231; SC0023658; SC0013365; SC0023692
OSTI ID:
3011535
Alternate ID(s):
OSTI ID: 2553899
OSTI ID: 2895237
Journal Information:
Journal of Computational Physics, Journal Name: Journal of Computational Physics Vol. 531; ISSN 0021-9991
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English

References (29)

Improving the scalability of a symmetric iterative eigensolver for multi-core platforms: IMPROVING THE SCALABILITY OF A SYMMETRIC ITERATIVE EIGENSOLVER journal September 2013
A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors journal October 2020
Convergence Theory for Preconditioned Eigenvalue Solvers in a Nutshell journal November 2015
Block Krylov–Schur method for large symmetric eigenvalue problems journal March 2008
Convergence acceleration of iterative sequences. the case of scf iteration journal July 1980
The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices journal January 1975
Davidson's method and preconditioning for generalized eigenvalue problems journal July 1990
Numerics of Gram-Schmidt orthogonalization journal January 1994
Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver journal January 2018
Hybrid eigensolvers for nuclear configuration interaction calculations journal November 2023
Accelerating an iterative eigensolver for nuclear structure configuration interaction calculations on GPUs using OpenACC journal March 2022
N3LO NN interaction adjusted to light nuclei in ab exitu approach journal October 2016
Ab initio no core shell model journal March 2013
Scaling of ab-initio nuclear physics calculations on multicore computer architectures journal May 2010
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I journal November 1949
A new method for diagonalising large matrices journal June 1985
An analysis of the Rayleigh--Ritz method for approximating eigenspaces journal February 2000
An incomplete factorization technique for positive definite linear systems journal May 1980
Improved many-body expansions from eigenvector continuation journal April 2020
Eigenvector Continuation with Subspace Learning journal July 2018
Convergence of Eigenvector Continuation journal January 2021
Solution of Sparse Indefinite Systems of Linear Equations journal September 1975
Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers journal January 2009
A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration journal January 2012
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems journal January 2000
A Krylov--Schur Algorithm for Large Eigenproblems journal January 2002
A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems journal January 1994
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

Similar Records

Hybrid eigensolvers for nuclear configuration interaction calculations
Journal Article · Mon Aug 07 00:00:00 EDT 2023 · Computer Physics Communications · OSTI ID:2439952