A grid-based Bader analysis algorithm without lattice bias
read more
Citations
Electronic structure calculations with GPAW: a real-space implementation of the projector augmented-wave method
Gabedit—A graphical user interface for computational chemistry softwares
CO2 electroreduction to ethylene via hydroxide-mediated copper catalysis at an abrupt interface
Accurate and efficient algorithm for Bader charge integration
Enhanced electrocatalytic CO2 reduction via field-induced reagent concentration
References
From ultrasoft pseudopotentials to the projector augmented-wave method
Special points for brillouin-zone integrations
Ab initio molecular dynamics for liquid metals.
Soft self-consistent pseudopotentials in a generalized eigenvalue formalism.
Atoms in molecules : a quantum theory
Related Papers (5)
Generalized Gradient Approximation Made Simple
Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set.
Frequently Asked Questions (12)
Q2. What was the valance charge for the Brillouin zone?
A plane wave energy cutoff of 262.5 eV was used, and the Brillouin zone was sampled with a 3 × 3 × 3 Monkhorst–Pack [26] k-point mesh.
Q3. What are the common methods used to calculate the many-body electronic interactions between atoms?
First principles methods, and especially density functional theory (DFT), are commonly used to calculate the many-body electronic interactions between atoms in molecules and in the solid state.
Q4. What is the strength of the on-grid method?
A strength of the on-grid method is that there is a fixed computational effort per charge density grid point, and therefore the total computational time scales linearly with the number of grid points [18].
Q5. What is the effect of the Bader analysis algorithm?
The Bader analysis algorithm presented here removes the lattice bias of a constrained grid-based algorithm [18] allowing convergence in the limit of a fine charge density grid.
Q6. What is the advantage of Bader partitioning?
This Bader partitioning has an advantage over other partitioningschemes (e.g. Mulliken population analysis) in that it is based upon the charge density, which is an observable quantity that can be measured experimentally or calculated.
Q7. What is the charge density of a Bader volume?
Each Bader volume contains a single charge density maximum, and is separated from other volumes by surfaces on which the charge density is a minimum normal to the surface.
Q8. What is the lattice bias in the on-grid method?
Ascent trajectories step between grid points in the direction that is most aligned with the charge density gradient (see equation (1)).
Q9. How is the charge density calculated in a NaCl salt crystal?
In order to show convergence of the method with respect to grid density, the authors have calculated the Bader charges in a NaCl salt crystal, using the eight-atom unit cell illustrated in figure 6 (inset).
Q10. How is the charge density grid calculated?
To associate this point with a Bader volume, a path of steepest ascent is followed between neighboring grid points along the charge density gradient.(ii) From each grid point along the path, (i, j, k), the projection of the charge density gradient is calculated along the direction to each of the 26 neighboring grid points,∇ρ(i, j, k) · r̂(di, d j, dk) = ρ| r̂ | .
Q11. Why is the Bader algorithm important for large systems?
This is particularly important for plane-wave-based DFT calculations, because it allows for the analysis of condensed phase systems with many atoms.
Q12. What was the original algorithm used to determine the Bader volumes?
In that original work, an algorithm was introduced in which ascent trajectories along the charge density were followed between grid points to determine the Bader volumes.