Hybrid eigensolvers for nuclear configuration interaction calculations
From MaRDI portal
Publication:6051371
Abstract: 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.
Recommendations
- Toward emulating nuclear reactions using eigenvector continuation
- Hybrid deterministic/Monte Carlo neutronics
- Solving the eigenvalue problem of the nuclear Yukawa-folded mean-field Hamiltonian
- scientific article; zbMATH DE number 733545
- Method for solving the many-body bound state nuclear problem
- An approximate eigensolver for self-consistent field calculations
- NuSol -- numerical solver for the 3D stationary nuclear Schrödinger equation
Cites work
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- A Krylov--Schur algorithm for large eigenproblems
- A new method for diagonalising large matrices
- A robust and efficient implementation of LOBPCG
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- ARPACK Users' Guide
- Basis selection in LOBPCG
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Bounding the spectrum of large Hermitian matrices
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- Computing probabilistic bounds for extreme eigenvalues of symmetric matrices with the Lanczos method
- Convergence of the block Lanczos method for eigenvalue clusters
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Numerical methods for large eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(1)
This page was built for publication: Hybrid eigensolvers for nuclear configuration interaction calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051371)
