返回
Bootstrapped block Lanczos for large-dimension eigenvalue problems
DOI:10.1016/j.cpc.2023.108835.png)
摘要
En 中文
The Lanczos algorithm has proven itself to be a valuable matrix eigensolver for problems with large dimensions, up to hundreds of millions or even tens of billions. The computational cost of using any Lanczos algorithm is dominated by the number of sparse matrix-vector multiplications required to reach suitable convergence. Block Lanczos replaces sparse matrix-vector multiplication with sparse matrixmatrix multiplication; sparse matrix-matrix multiplication is more efficient, due to improved data locality and amortizing the cost of fetching or constructing a matrix element, but for a randomly chosen starting block (or pivot), block Lanczos requires more multiplications to reach convergence. We find that a bootstrapped pivot block, that is, an initial block constructed from approximate eigenvectors computed in a truncated space, leads to a dramatically reduced number of multiplications, significantly outperforming both standard vector Lanczos and block Lanczos with a random pivot. A key condition for speed-up is that the pivot block has a non-trivial overlap with the final converged vector. We implement this approach in a configuration-interaction code for nuclear structure, and find a reduction in time-to-solution by a factor of two or more, up to a factor of ten.& COPY; 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons .org /licenses /by-nc -nd /4 .0/).
Keyword:
Eigensolver
Krylov space method
Arnoldi methods
Nuclear many-body problem
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W

