Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 4,287

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Improved grid‐based algorithm for Bader charge allocation

Sanville, Edward, Kenny, Steven D., Smith, Roger, Henkelman, Graeme·2007·Journal of Computational Chemistry

Abstract

An improvement to the grid‐based algorithm of Henkelman et al. for the calculation of Bader volumes is suggested, which more accurately calculates atomic properties as predicted by the theory of Atoms in Molecules. The CPU time required by the improved algorithm to perform the Bader analysis scales linearly with the number of interatomic surfaces in the system. The new algorithm corrects systematic deviations from the true Bader surface, calculated by the original method and also does not require explicit representation of the interatomic surfaces, resulting in a more robust method of partitioning charge density among atoms in the system. Applications of the method to some small systems are given and it is further demonstrated how the method can be used to define an energy per atom in ab initio calculations. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/jcc.20575

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 4,287

Metadata

Authors
Sanville, E., Kenny, S. D., Smith, R., & Henkelman, G.
Venue
Journal of Computational Chemistry
Publisher
Wiley
Published
2007-01-19
Volume
28
Issue
5
Pages
899-908
ISSN
  • 0192-8651 (ISSN-L)
  • 1096-987X
OpenAlex
W2119607070
Cited by
4,287
References
1
FWCI
36.46
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improved grid‐based algorithm for Bader charge allocation. https://app.cochat.ai/papers/10.1002/jcc.20575
The paper
Sanville, E., Kenny, S. D., Smith, R., & Henkelman, G. (2007). Improved grid‐based algorithm for Bader charge allocation. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.20575

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.