Wrap-around errors
In this section we will discuss wrap around errors. Wrap around errors arise if the FFT meshes are not sufficiently large. It can be shown that no errors exist if the FFT meshes contain all $G$ vectors up to .
It can be shown that the charge density contains components up to , where is the "longest" plane wave in the basis set:
The wavefunction is defined as
and in real space it is given by
Using Fast Fourier transformations one can define
Therefore the wavefunction can be written in real space as
The charge density is simply given by
and in the reciprocal mesh it can be written as
Inserting Failed to parse (Conversion error. Server ("cli") reported: "[INVALID]"): {\displaystyle \rhops}
from equation (\ref{rps}) and $ C_\rnk$ from (\ref{pl2}) it
is very easy to show that $\rhops_\br $ contains Fourier-components up
to $2 G_{\rm cut}$.
Generally it can be shown that a the convolution $f_r=f^1_r f^2_r$ of two 'functions' $f^1_r$ with Fourier-components up to $G_1$ and $f^2_r$ with Fourier-components up to $G_2$ contains Fourier-components up to $G_1+G_2$.
The property of the convolution comes once again into play, when the action of the Hamiltonian onto a wavefunction is calculated. The action of the local-potential is given by \[
a_\br = V_\br C_\rnk
\] Only the components $a_\bG$ with $|\bG| < G_{\rm cut}$ are taken into account (see section \ref{algo}: $a_\bG$ is added to the wavefunction during the iterative refinement of the wavefunctions $C_\Gnk$, and $C_\Gnk$ contains only components up to $G_{\rm cut}$). From the previous theorem we see that $a_\br$ contains components up to $3 G_{\rm cut}$ ($V_\br$ contains components up to
$2 G_{\rm cut}$). \begin{figure} \unitlength1cm \epsffile{algo1.eps} \caption{ \label{algo-fig1} The small sphere contains all plane waves included in the basis set $G<G_{\rm cut}$. The charge density contains components up to $2 G_{\rm cut}$ (second sphere), and the acceleration $a$ components up to $3 G_{\rm cut}$, which are reflected in (third sphere) because of the finite size of the FFT-mesh. Nevertheless the components $a_\bG$ with $| \bG| < G_{\rm cut}$ are correct i.e. the small sphere does not intersect with the third large sphere } \end{figure} If the FFT-mesh contains all components up to $2 G_{\rm cut}$ the resulting wrap-around error is once again 0. This can be easily seen in Fig. \ref{algo-fig1}.