Accurate and efficient algorithm for Bader charge integration

2.0kCitations
Citations of this article
789Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose an efficient, accurate method to integrate the basins of attraction of a smooth function defined on a general discrete grid and apply it to the Bader charge partitioning for the electron charge density. Starting with the evolution of trajectories in space following the gradient of charge density, we derive an expression for the fraction of space neighboring each grid point that flows to its neighbors. This serves as the basis to compute the fraction of each grid volume that belongs to a basin (Bader volume) and as a weight for the discrete integration of functions over the Bader volume. Compared with other grid-based algorithms, our approach is robust, more computationally efficient with linear computational effort, accurate, and has quadratic convergence. Moreover, it is straightforward to extend to nonuniform grids, such as from a mesh-refinement approach, and can be used to both identify basins of attraction of fixed points and integrate functions over the basins. © 2011 American Institute of Physics.

Cite

CITATION STYLE

APA

Yu, M., & Trinkle, D. R. (2011). Accurate and efficient algorithm for Bader charge integration. Journal of Chemical Physics, 134(6). https://doi.org/10.1063/1.3553716

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free