Efficient Krylov methods for linear response in plane-wave electronic structure calculations
Michael F. Herbst, Bonan Sun
TL;DR
This work develops an efficient solver for linear response in plane-wave DFT by solving the Dyson equation with an inexact, preconditioned GMRES framework. A rigorous error analysis shows how inexact Sternheimer solves propagate to the Dyson solution, enabling adaptive selection of Sternheimer tolerances that preserve accuracy while reducing cost; Kerker preconditioning is used to accelerate convergence in metals. The proposed balanced (bal) and related strategies consistently reduce computational effort by about 40% (and up to 4× when combined with preconditioning) across challenging materials such as Aluminium, Heusler alloys, and Silicon, without sacrificing the final accuracy. The approach integrates seamlessly with standard preconditioning and Krylov techniques, offering a scalable, black-box solver for DFPT that can be extended to other mean-field theories.
Abstract
We propose a novel algorithm based on inexact GMRES methods for linear response calculations in density functional theory. Such calculations require iteratively solving a nested linear problem $\mathcal{E} δρ= b$ to obtain the variation of the electron density $δρ$. Notably each application of the dielectric operator $\mathcal{E}$ in turn requires the iterative solution of multiple linear systems, the Sternheimer equations. We develop computable bounds to estimate the accuracy of the density variation given the tolerances to which the Sternheimer equations have been solved. Based on this result we suggest reliable strategies for adaptively selecting the convergence tolerances of the Sternheimer equations, such that each application of $\mathcal{E}$ is no more accurate than needed. Experiments on challenging materials systems of practical relevance demonstrate our strategies to achieve superlinear convergence as well as a reduction of computational time by about 40% while preserving the accuracy of the returned response solution. Our algorithm seamlessly combines with standard preconditioning approaches known from the context of self-consistent field problems making it a promising framework for efficient response solvers based on Krylov subspace techniques.
