Related papers: Efficiency of Generalized Regular k-point Grids

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…

Computational modeling of the properties of crystalline materials has become an increasingly important aspect of materials research, consuming hundreds of millions of CPU-hours at scientific computing centres around the world each year, if…

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…

The sensitivity of computed DFT (Density Functional Theory) molecular properties (including energetics, geometries, vibrational frequencies, and infrared intensities) to the radial and angular numerical integration grid meshes, as well as…

While standard computational protocols for density functional theory (DFT) have universal applicability, differences exist in code implementations. Specific applications require manual parameter optimization, whereas high-throughput…

In this work, we developed an automatic convergence procedure for k-points and plane wave cut-off in density functional (DFT) calculations and applied it to more than 30000 materials. The computational framework for automatic convergence…

This work presents new Gaussian single- and double-zeta basis sets optimized for stochastic density functional theory (sDFT) using real-space auxiliary grids. Previous studies showed standard basis sets like STO-3G and 6-31G are sub-optimal…

We discuss the application of graphical processing units (GPUs) to accelerate real-space density functional theory (DFT) calculations. To make our implementation efficient, we have developed a scheme to expose the data parallelism available…

DFT calculations have become widespread in both chemistry and materials, because they usually provide useful accuracy at much lower computational cost than wavefunction-based methods. All practical DFT calculations require an approximation…

An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…

MRI data is acquired in Fourier space/k-space. Data acquisition is typically performed on a Cartesian grid in this space to enable the use of a fast Fourier transform algorithm to achieve fast and efficient reconstruction. However, it has…

We present a new algorithm which allows for direct numerically exact solutions within dynamical mean-field theory (DMFT). It is based on the established Hirsch-Fye quantum Monte Carlo (HF-QMC) method. However, the DMFT impurity model is…

Additive Gaussian Processes (GPs) are popular approaches for nonparametric feature selection. The common training method for these models is Bayesian Back-fitting. However, the convergence rate of Back-fitting in training additive GPs is…

Several recent works have introduced highly compact representations of single-particle Green's functions in the imaginary time and Matsubara frequency domains, as well as efficient interpolation grids used to recover the representations. In…

I describe a modification to the original Fast Multipole Method (FMM) of Greengard & Rokhlin that approximates the gravitation field of an FMM cell as a small uniform grid (a "gridlet") of effective masses. The effective masses on a gridlet…

Block Floating Point (BFP) arithmetic is currently seeing a resurgence in interest because it requires less power, less chip area, and is less complicated to implement in hardware than standard floating point arithmetic. This paper explores…

We present efficient realization of Generalized Givens Rotation (GGR) based QR factorization that achieves 3-100x better performance in terms of Gflops/watt over state-of-the-art realizations on multicore, and General Purpose Graphics…

We present an efficient implementation of periodic Gaussian density fitting (GDF) using the Coulomb metric. The three-center integrals are divided into two parts by range-separating the Coulomb kernel, with the short-range part evaluated in…

Variance reduced stochastic gradient (SGD) methods converge significantly faster than the vanilla SGD counterpart. However, these methods are not very practical on large scale problems, as they either i) require frequent passes over the…

Kohn-Sham density functional theory (DFT) is a widely-used electronic structure theory for materials as well as molecules. DFT is needed especially for large systems, ab initio molecular dynamics, and high-throughput searches for functional…