... | @@ -50,7 +50,7 @@ scanning the k-space can be a heavy computational task, especially for |
... | @@ -50,7 +50,7 @@ scanning the k-space can be a heavy computational task, especially for |
|
refine the mesh and keep in memory only the zones crossed by a band. So
|
|
refine the mesh and keep in memory only the zones crossed by a band. So
|
|
in a first step the algorithm will quad the Brillouin zone, into
|
|
in a first step the algorithm will quad the Brillouin zone, into
|
|
tetrahedras (triangles in 2D), and then evaluate if along the edges we
|
|
tetrahedras (triangles in 2D), and then evaluate if along the edges we
|
|
can find a solution satisfying $`|\lambda_\nu(\vec{k},E)|\<a_n`$,
|
|
can find a solution satisfying $`|\lambda_\nu(\vec{k},E)|<a_n`$,
|
|
where $`a_n`$ is a given accuracy.
|
|
where $`a_n`$ is a given accuracy.
|
|
|
|
|
|
If a solution is found along a tetrahedra edges, the mesh is refined in
|
|
If a solution is found along a tetrahedra edges, the mesh is refined in
|
... | | ... | |