Answers are grounded in this paper and cite their sources.
The locally optimal block preconditioned conjugate gradient (LOBPCG) method is a popular solver for large and sparse Hermitian eigenvalue problems. However, recently proposed alternatives for its single‐vector version LOPCG indicate certain problematic cases with less accurate preconditioners and clustered target eigenvalues. Therein LOPCG suffers from convergence delays with strongly oscillating reduction of residual norms. By interpreting LOPCG as a truncated generalized Davidson iteration, we propose utilizing some specific information from the convergence history to recover the major loss caused by truncation. Two new schemes are presented: LOPCGa, where the trial subspace is augmented and managed by an angle‐based criterion; and TPCGa, which employs augmented two‐term recurrences with a residual‐based update strategy to reduce dependence on the threshold choice. Numerical experiments demonstrate that both schemes outperform LOPCG and its recent competitors regarding the number of required steps and the total computational time.
No takes yet. Share an insight, caveat, or question.
Zhou et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: