Low-scaling GW: The space-time formalism: Difference between revisions

From VASP Wiki
No edit summary
Line 22: Line 22:
</math>
</math>


Afterwards, the same compressed Fourier transformation as for the [[ACFDT/RPA calculations#ACFDTR/RPAR| low scaling ACFDT/RPA algorithm]] is employed to obtain the irreducible polarizability in reciprocal space on the imaginary frequency axis <math>\chi({\bf r},{\bf r}',i\tau_m) \to \chi_{{\bf G}{\bf G}'}({\bf q},i \omega_n) </math>.<ref name="kaltak"/><ref name="liu"/>
Afterwards, the same compressed Fourier transformation as for the [[Groundstate in the Random Phase Approximation#ACFDTR/RPAR| low scaling ACFDT/RPA algorithms]] is employed to obtain the irreducible polarizability in reciprocal space on the imaginary frequency axis <math>\chi({\bf r},{\bf r}',i\tau_m) \to \chi_{{\bf G}{\bf G}'}({\bf q},i \omega_n) </math>.<ref name="kaltak"/><ref name="liu"/>


The next step is the computation of the screened potential
The next step is the computation of the screened potential

Revision as of 09:50, 26 July 2019

Available as of VASP.6 are low-scaling algorithms for ACFDT/RPA.[1] This page describes the formalism of the corresponding low-scaling GW approach.[2] A theoretical description of the ACFDT/RPA total energies is found here. A brief summary regarding GW theory is given below, while a practical guide can be found here.

Theory

The GW implementations in VASP described in the papers of Shishkin et al.[3][4] avoid storage of the Green's function as well as Fourier transformations between time and frequency domain entirely. That is, all calculations are performed solely on the real frequency axis using Kramers-Kronig transformations for convolutions in the equation of and in reciprocal space and results in a relatively high computational cost that scales with (number of electrons).

The scaling with system size can, however, be reduced to by performing a so-called Wick-rotation to imaginary time .[5]

Following the low scaling ACFDT/RPA algorithms the space-time implementation determines first, the non-interacting Green's function on the imaginary time axis in real space

Here is the step function and the occupation number of the state . Because the Green's function is non-oscillatory on the imaginary time axis it can be represented on a coarse grid , where the number of time points can be selected in VASP via the NOMEGA tag. Usually 12 to 16 points are sufficient for insulators and small band gap systems.[6]

Subsequently, the irreducible polarizability is calculated from a contraction of two imaginary time Green's functions

Afterwards, the same compressed Fourier transformation as for the low scaling ACFDT/RPA algorithms is employed to obtain the irreducible polarizability in reciprocal space on the imaginary frequency axis .[6][2]

The next step is the computation of the screened potential


followed by the inverse Fourier transform and the calculation of the self-energy

From here, several routes are possible including all approximations mentioned above, that is the single-shot, EVG0 and QPEVG0 approximation. All approximations have one point in common.

In contrast to the real-frequency implementation, the low-scaling GW algorithms require an analytical continuation of the self-energy from the imaginary frequency axis to the real axis. In general, this is an ill-defined problem and usually prone to errors, since the self-energy is known on a finite set of points. VASP determines internally a Padé approximation of the self-energy from the calculated set of NOMEGA points and solves the non-linear eigenvalue problem

on the real frequency axis .

Because, preceding Fourier transformations have been carried out with exponentially suppressed errors, the analytical continuation of the self-energy can be determined with high accuracy. The analytical continuation typically yields energies that differ less than 20 meV from quasi-particle energies obtained from the real-frequency calculation.[2]

In addition, the space-time formulation allows to solve the full Dyson equation for with decent computational cost.[7] This approach is known as the self-consistent GW approach (scGW) and is available as of VASP6.

References