Efficiency of Generalized Regular k-point Grids

Abstract

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.

References in corpus (7)

• AFLOW: An automatic framework for high-throughput materials discovery
• Low Hole Effective Mass p-type Transparent Conducting Oxides: Identification and Design Principles
• Prediction and accelerated laboratory discovery of previously unknown 18-electron ABX compounds
• High-Mobility Bismuth-based Transparent P-Type Oxide from High-throughput Material Screening
• First principles studies of SnTiO3 perovskite as a potential ferroelectric material
• High-Throughput Screening of Perovskite Alloys for Piezoelectric Performance and Formability
• Numerical quadrature in the Brillouin zone for periodic Schrodinger operators

Cited by in corpus (8)

• Implementation strategies in phonopy and phono3py
• Convergence and machine learning predictions of Monkhorst-Pack k-points and plane-wave cut-off in high-throughput DFT calculations
• Machine-learned multi-system surrogate models for materials prediction
• Rapid Generation of Optimal Generalized Monkhorst-Pack Grids
• Phase transitions in partial summation methods: Results from the 3D Hubbard model
• Automated optimization of convergence parameters in plane wave density functional theory calculations via a tensor decomposition-based uncertainty quantification
• A robust algorithm for $k$-point grid generation and symmetry reduction
• Decoding lithium's subtle phase stability with a machine learning force field