一种稳健的$k$点网格生成和对称性约简算法
A robust algorithm for $k$-point grid generation and symmetry reduction
摘要:
我们开发了一种算法,用于i)计算广义规则$k$点网格,ii)将网格简化为其对称的不同点,以及iii)将简化的网格点映射到布里渊区。该算法利用整数矩阵和有限群之间的联系,以实现与$k$ -点的数量呈线性关系的计算复杂度。有利的缩放意味着,在给定的$k$点密度下,可以生成所有可能的相称网格(如Moreno和Soler所建议的),并快速减少以识别具有最少对称唯一$k$点的网格。与Monkhorst-Pack $k$ -点网格相比,这些优化网格提供了显著的加速;它们具有更好的对称性约简,从而在给定的网格密度下产生更少的不可约$k$ -点。这种新的约简算法的整数性质也简化了当前实现中具有有限精度的问题。该算法可作为开源软件使用。
英文摘要:
We develop an algorithm for i) computing generalized regular $k$-point grids, ii) reducing the grids to their symmetrically distinct points, and iii) mapping the reduced grid points into the Brillouin zone. The algorithm exploits the connection between integer matrices and finite groups to achieve a computational complexity that is linear with the number of $k$-points. The favorable scaling means that, at a given $k$-point density, all possible commensurate grids can be generated (as suggested by Moreno and Soler) and quickly reduced to identify the grid with the fewest symmetrically unique $k$-points. These optimal grids provide significant speed-up compared to Monkhorst-Pack $k$-point grids; they have better symmetry reduction resulting in fewer irreducible $k$-points at a given grid density. The integer nature of this new reduction algorithm also simplifies issues with finite precision in current implementations. The algorithm is available as open source software.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。