arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.03257cond-mat.mtrl-sciphysics.comp-ph
收藏

动态生成广义规则k点网格

Generalized Regular k-point Grid Generation On The Fly

Wiley S. Morgan, John E. Christensen, Parker K. Hamilton, Jeremy J. Jorgensen, Branton J. Campbell, Gus L. W. Hart, Rodney W. Forcade

摘要:

在DFT社区中,通常的做法是使用常规k点网格(Monkhorst-Pack,MP)进行Brillioun区域积分。最近Wisesa et. \cite{wisesa2016efficient}和Morgan et. \cite{MORGAN2018424}等人证明了广义规则(GR)网格比传统MP网格具有优势。GR网格尚未被广泛采用,因为必须搜索大量的候选网格。这项工作描述了一种算法,可以快速搜索GR网格的那些具有最均匀的点分布和最好的对称性减少。平均而言,网格的效率比MP网格高出约60%,现在可以在几秒钟内动态生成。

英文摘要:

In the DFT community, it is common practice to use regular k-point grids (Monkhorst-Pack, MP) for Brillioun zone integration. Recently Wisesa et. al.\cite{wisesa2016efficient} and Morgan et. al.\cite{MORGAN2018424} demonstrated that generalized regular (GR) grids offer advantages over traditional MP grids. GR grids have not been widely adopted because one must search through a large number of candidate grids. This work describes an algorithm that can quickly search over GR grids for those that have the most uniform distribution of points and the best symmetry reduction. The grids are ~60% more efficient, on average, than MP grids and can now be generated on the fly in seconds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑