Improved grid-based algorithm for Bader charge allocation

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational chemistry Jg. 28; H. 5; S. 899 - 908
Hauptverfasser: Sanville, Edward, Kenny, Steven D., Smith, Roger, Henkelman, Graeme
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 15.04.2007
Wiley Subscription Services, Inc
Schlagworte:
Algorithms
atomic energy
Bader charge
Bader volumes
Density
Electric fields
Nuclear energy
numerical integration
ISSN:0192-8651, 1096-987X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
Bibliographie:istex:E61DDDBE0219F0EDF5ACBE4512490DC64865FDA4
ark:/67375/WNG-TXGGB4SV-5
ArticleID:JCC20575
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0192-8651
1096-987X
DOI:10.1002/jcc.20575