Published in

International Union of Crystallography, IUCrJ, 2(9), p. 298-315, 2022

DOI: 10.1107/s2052252522000690

Links

Tools

Export citation

Search in Google Scholar

Fragmentation and transferability in Hirshfeld atom refinement

This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Hirshfeld atom refinement (HAR) is one of the most effective methods for obtaining accurate structural parameters for hydrogen atoms from X-ray diffraction data. Unfortunately, it is also relatively computationally expensive, especially for larger molecules due to wavefunction calculations. Here, a fragmentation approach has been tested as a remedy for this problem. It gives an order of magnitude improvement in computation time for larger organic systems and is a few times faster for metal–organic systems at the cost of only minor differences in the calculated structural parameters when compared with the original HAR calculations. Fragmentation was also applied to polymeric and disordered systems where it provides a natural solution to problems that arise when HAR is applied. The concept of fragmentation is closely related to the transferable aspherical atom model (TAAM) and allows insight into possible ways to improve TAAM. Hybrid approaches combining fragmentation with the transfer of atomic densities between chemically similar atoms have been tested. An efficient handling of intermolecular interactions was also introduced for calculations involving fragmentation. When applied in fragHAR (a fragmentation approach for polypeptides) as a replacement for the original approach, it allowed for more efficient calculations. All of the calculations were performed with a locally modified version of Olex2 combined with a development version of discamb2tsc and ORCA. Care was taken to efficiently use the power of multicore processors by simple implementation of load-balancing, which was found to be very important for lowering computational time.