Papers › Efficiency of Generalized Regular k-point Grids
Efficiency of Generalized Regular k-point Grids
Wiley S. Morgan, Jeremy J. Jorgensen, Bret C. Hess, Gus L. W. Hart
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Most DFT practitioners use regular grids (Monkhorst-Pack, MP) for integrations in the Brillioun zone. Although regular grids are the natural choice and easy to generate, more general grids whose generating vectors are not merely integer divisions of the reciprocal lattice vectors, are usually more efficient.\cite{wisesa2016efficient} We demonstrate the efficiency of \emph{generalized regular} (GR) grids compared to Monkhorst-Pack (MP) and \emph{simultaneously commensurate} (SC) grids. In the case of metals, for total energy accuracies of one meV/atom, GR grids are 60\% faster on average than MP grids and 20\% faster than SC grids. GR grids also have greater freedom in choosing the \kb-point density, enabling the practitioner to achieve a target accuracy with the minimum computational cost.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections