Answers are grounded in this paper and cite their sources.
We analyze the performance of two strategies in solving the structured eigenvalue problem deriving from the Bethe–Salpeter equation (BSE) in condensed matter physics. The BSE matrix is constructed with the Yambo code, and the two strategies are implemented by interfacing Yambo with the ScaLAPACK and ELPA libraries for direct diagonalization, and with the SLEPc library for the iterative approach. We consider both the Hermitian (Tamm–Dancoff approximation) and pseudo-Hermitian forms, addressing dense matrices of three different sizes. A description of the implementation is also provided, with details for the pseudo-Hermitian case. Timing and memory utilization are analyzed on both CPU and GPU clusters. Our results demonstrate that it is now feasible to handle dense BSE matrices of the order of 10 5 .
No takes yet. Share an insight, caveat, or question.
Milev et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: