arXiv subjects

Jeremy J. Jorgensen

Publications and source records attributed to Jeremy J. Jorgensen.

5 recordsLinked to original sources

arXiv2022

A general algorithm for calculating irreducible Brillouin zones

Calculations of properties of materials require performing numerical integrals over the Brillouin zone (BZ). Integration points in density functional theory codes are uniformly spread over the BZ (despite integration error being concentrated in small regions of the BZ) and preserve symmetry to improve computational efficiency. Integration points over an irreducible Brillouin zone (IBZ), a rotationally distinct region of the BZ, do not have to preserve crystal symmetry for greater efficiency. This freedom allows the use of adaptive meshes with higher concentrations of points at locations of large error, resulting in improved algorithmic efficiency. We have created an algorithm for constructing an IBZ of any crystal structure in 2D and 3D. The algorithm uses convex hull and half-space representations for the BZ and IBZ to make many aspects of construction and symmetry reduction of the BZ trivial. The algorithm is simple, general, and available as open-source software.

cond-mat.mtrl-sci↗

arXiv2021

Effectiveness of smearing and tetrahedron methods: best practices in DFT codes

Density functional theory (DFT) codes are commonly treated as a "black box" in high-throughput screening of materials, with users opting for the default values of the input parameters. Often, non-experts may not sufficiently consider the effect of these parameters on prediction quality. In this work, we attempt to identify a robust set of parameters related to smearing and tetrahedron methods that return numerically accurate and efficient results for a wide variety of metallic systems. The effects of smearing and tetrahedron methods on the total energy, number of self-consistent field cycles, and forces on atoms are studied in two popular DFT codes: the Vienna Ab initio Simulation Package (VASP) and Quantum Espresso (QE). From nearly 40,000 computations, it is apparent that the optimal smearing depends on the system, smearing method, smearing parameter, and $k$-point density. The benefit of smearing is a minor reduction in the number of self-consistent field cycles, which is independent of the smearing method or parameter. A large smearing parameter -- what is considered large is system dependent -- leads to inaccurate total energies and forces. Blöchl's tetrahedron method leads to small improvements in total energies. When treating diverse systems with the same input parameters, we suggest using as little smearing as possible due to the system dependence of smearing and the risk of selecting a parameter that gives inaccurate energies and forces.

cond-mat.mtrl-sci↗

arXiv2019

A robust algorithm for $k$-point grid generation and symmetry reduction

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.

physics.comp-ph↗

arXiv2019

Generalized Regular k-point Grid Generation On The Fly

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.

cond-mat.mtrl-sci↗

arXiv2018

Efficiency of Generalized Regular k-point Grids

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.

cond-mat.mtrl-sci↗