Wrap-around errors: Difference between revisions

From VASP Wiki
(Created page with "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 mesh...")
 
No edit summary
 
(26 intermediate revisions by 3 users not shown)
Line 2: Line 2:
Wrap around errors arise if the FFT meshes are not
Wrap around errors arise if the FFT meshes are not
sufficiently large. It can be shown that no errors exist
sufficiently large. It can be shown that no errors exist
if the FFT meshes contain all $G$ vectors up to <math>2 G_{\rm cut}</math>.
if the FFT meshes contain all <math>\bold{G}</math> vectors up to <math>2 G_{\rm cut}</math>.
 
[[File:Wrap errors spheres.png|350px|thumb|Fig. 1: Sphere intersections for <math>G_{\mathrm{cut}}</math>]]


It can be shown that the charge density contains
It can be shown that the charge density contains
components up to <math>2 G_{\rm cut}</math>, where <math>2 G_{\rm cut}</math> is
components up to <math>2 G_{\mathrm{cut}}</math>, where <math>2 G_{\mathrm{cut}}</math> is
the "longest" plane wave in the basis set:
the "longest" plane wave in the basis set:


Line 11: Line 13:


<math>
<math>
  | \phi_\nk \rangle = \sum_G C_\Gnk | \bk+\bG\rangle,
  | \phi_{n\bold{k}} \rangle = \sum_\bold{G} C_{\bold{G}n\bold{k}} | \bold{k}+\bold{G}\rangle,
</math>
</math>


Line 17: Line 19:


<math>
<math>
  \langle\br| \phi_\nk \rangle = \sum_\bG \langle\br| \bk+\bG\rangle \langle \bk+\bG|\phi_\nk \rangle
  \langle \bold{r}| \phi_{n\bold{k}} \rangle = \sum_\bold{G} \langle \bold{r}| \bold{k}+\bold{G}\rangle \langle \bold{k}+\bold{G}|\phi_{n\bold{k}} \rangle
     =  \frac{1}{\Omega^{1/2}} \sum_\bG e^{i(\bk+\bG)\br}  C_\Gnk.
     =  \frac{1}{\Omega^{1/2}} \sum_\bold{G} e^{i(\bold{k}+\bold{G})\bold{r}}  C_{\bold{G}n\bold{k}}.
</math>
</math>


Line 24: Line 26:


<math>
<math>
  C_\rnk= \sum_{\bG} C_\Gnk e^{i\bG \br} \hspace{2cm}
  C_{\bold{r}n\bold{k}}= \sum_{\bold{G}} C_{\bold{G}n\bold{k}} e^{i\bold{G} \bold{r}} \qquad \qquad \qquad
  C_\Gnk= \frac{1}{N_{\rm FFT}} \sum_{\br} C_\rnk e^{-i\bG \br}.
  C_{\bold{G}n\bold{k}}= \frac{1}{N_{\mathrm{FFT}}} \sum_{\bold{r}} C_{\bold{r}n\bold{k}} e^{-i\bold{G} \bold{r}}.
</math>
</math>


Line 31: Line 33:


<math>
<math>
  \langle\br| \phi_\nk \rangle = \phi_\nk(r) = \frac{1}{\Omega^{1/2}} C_\rnk e^{i\bk\br}.
  \langle\bold{r}| \phi_{n\bold{k}} \rangle = \phi_{n\bold{k}}(r) = \frac{1}{\Omega^{1/2}} C_{\bold{r}n\bold{k}} e^{i\bold{k}\bold{r}}.
</math>
</math>


Line 37: Line 39:


<math>
<math>
  \rhops_\br \equiv \langle\br | \rhops| \br\rangle =
  \rho^{\mathrm{ps}}_{\bold{r}} \equiv \langle \bold{r} |\rho^{\mathrm{ps}} | \bold{r} \rangle =
  \sum_\bk w_\bk \sum_n f_\nk \phi_\nk(r) \phi^*_\nk(r) ,
  \sum_\bold{k} w_{\bold{k}} \sum_n f_{n\bold{k}} \phi_{n\bold{k}}(r) \phi^{*}_{n\bold{k}}(r) ,
</math>
</math>


Line 44: Line 46:


<math>
<math>
  \rhops_\bG \equiv
  \rho^{\mathrm{ps}}_\bold{G} \equiv
     \frac{1}{\Omega} \int \langle\br | \rhops| \br\rangle e^{-i \bG\br}\, d \br \to \frac{1}{N_{\rm FFT}} \sum_{\br} \rhops_\br e^{-i \bG\br}.
     \frac{1}{\Omega} \int \langle\bold{r} | \rho^{\mathrm{ps}}| \bold{r}\rangle e^{-i \bold{G}\bold{r}}\, d \bold{r} \to \frac{1}{N_{\mathrm{FFT}}} \sum_{\bold{r}} \rho^{\mathrm{ps}}_{\bold{r}} e^{-i \bold{G}\bold{r}}.
</math>
</math>


[[template:NumBlk]]
Using the above equations for <math>\rho^{\mathrm{ps}}_{\bold{r}}</math> and <math>C_{\bold{r}n\bold{k}}</math> it
 
is very  easy to show that <math>\rho^{\mathrm{ps}}_{\bold{r}}</math> contains Fourier-components up
Inserting <math>\rhops</math> from equation (\ref{rps}) and $ C_\rnk$ from (\ref{pl2}) it
to <math>2 G_{\mathrm{cut}}</math>.
is very  easy to show that $\rhops_\br $ contains Fourier-components up
to $2 G_{\rm cut}$.


Generally it can be shown that
Generally it can be shown that
a the convolution $f_r=f^1_r f^2_r$
a the convolution <math>f_r=f^1_r f^2_r</math>
of two 'functions' $f^1_r$ with  Fourier-components
of two functions <math>f^1_r</math> with  Fourier-components
up to $G_1$ and $f^2_r$ with Fourier-components
up to <math>G_1</math> and <math>f^2_r</math> with Fourier-components
up to $G_2$ contains Fourier-components up to  $G_1+G_2$.
up to <math>G_2</math> contains Fourier-components up to  <math>G_1+G_2</math>.


The property of the convolution comes once again into play,
The property of the convolution comes once again into play,
when the action of the Hamiltonian onto a wavefunction is
when the action of the Hamiltonian onto a wavefunction is
calculated. The action of the local-potential is given by
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}$).
<math>
\begin{figure}  \unitlength1cm
a_{\bold{r}} =  V_{\bold{r}}  C_{\bold{r}n\bold{k}}.
\epsffile{algo1.eps}
</math>
\caption{ \label{algo-fig1}
 
The small sphere contains all plane waves included in the basis set  $G<G_{\rm cut}$.
Only the components <math>a_{\bold{G}}</math> with <math>|\bold{G}| < G_{\mathrm{cut}}</math> are taken into
The charge density contains components up to  $2 G_{\rm cut}$ (second sphere), and
account (see section {{TAG|ALGO}}: <math>a_{\bold{G}}</math> is added to the wavefunction
the acceleration $a$ components up to $3 G_{\rm cut}$, which are reflected
during the iterative refinement of the wavefunctions <math>C_{\bold{G}n\bold{k}}</math>,
and <math>C_{\bold{G}n\bold{k}}</math> contains only components up to <math>G_{\mathrm{cut}}</math>).
From the previous theorem we see that <math>a_{\bold{r}}</math> contains
components up to <math>3 G_{\mathrm{cut}}</math> (<math>V_{\bold{r}}</math> contains components up to
<math>2 G_{\mathrm{cut}}</math>).
 
If the FFT-mesh contains all components up to  <math>2 G_{\mathrm cut}</math>
the resulting wrap-around error is once again 0. This can
be easily seen in Fig. 1. Here we see that the small sphere contains all plane waves included in the basis set  <math>G<G_{\mathrm{cut}}</math>.
The charge density contains components up to  <math>2 G_{\mathrm{cut}}</math> (second sphere), and
the acceleration <math>a</math> components up to <math>3 G_{\mathrm{cut}}</math>, which are reflected
in (third sphere) because of the finite size of the FFT-mesh. Nevertheless
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 components <math>a_{\bold{G}}</math> with <math>| \bold{G}| < G_{\mathrm{cut}}</math> are correct i.e.
the small sphere does not intersect with the third large sphere
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}.


----
----
[[Category:Electronic Minimization]][[Category:Electronic Minimization Methods]][[Category:Charge Density]][[Category:Theory]]
[[Category:Electronic minimization]][[Category:Charge density]][[Category:Theory]]

Latest revision as of 16:07, 6 April 2022

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 vectors up to .

Fig. 1: Sphere intersections for

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

Using the above equations for and it is very easy to show that contains Fourier-components up to .

Generally it can be shown that a the convolution of two functions with Fourier-components up to and with Fourier-components up to contains Fourier-components up to .

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

Only the components with are taken into account (see section ALGO: is added to the wavefunction during the iterative refinement of the wavefunctions , and contains only components up to ). From the previous theorem we see that contains components up to ( contains components up to ).

If the FFT-mesh contains all components up to the resulting wrap-around error is once again 0. This can be easily seen in Fig. 1. Here we see that the small sphere contains all plane waves included in the basis set . The charge density contains components up to (second sphere), and the acceleration components up to , which are reflected in (third sphere) because of the finite size of the FFT-mesh. Nevertheless the components with are correct i.e. the small sphere does not intersect with the third large sphere}