Hybrid eigensolvers for nuclear configuration interaction calculations

被引:1
|
作者
Alperen, Abdullah [1 ]
Aktulga, Hasan Metin [1 ]
Maris, Pieter [2 ]
Yang, Chao [3 ]
机构
[1] Michigan State Univ, E Lansing, MI 48824 USA
[2] Iowa State Univ, Dept Phys & Astron, Ames, IA 50011 USA
[3] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
Nuclear configuration interaction calculation; Large-scale eigenvalue computation; Hybrid eigensolver; CONVERGENCE THEORY; LANCZOS-ALGORITHM; ITERATION METHOD; EIGENVALUE; IMPLEMENTATION; FACTORIZATION; ACCELERATION;
D O I
10.1016/j.cpc.2023.108888
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
引用
收藏
页数:15
相关论文
共 50 条