Premium
Efficient algorithms for calculating small‐angle scattering from large model structures
Author(s) -
Olds Daniel P.,
Duxbury Phillip M.
Publication year - 2014
Publication title -
journal of applied crystallography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.429
H-Index - 162
ISSN - 1600-5767
DOI - 10.1107/s1600576714005925
Subject(s) - fast fourier transform , monte carlo method , algorithm , scaling , gaussian , computer science , scattering , design for manufacturability , statistical physics , computational science , physics , mathematics , optics , mechanical engineering , statistics , geometry , quantum mechanics , engineering
This paper compares Monte Carlo approaches and fast Fourier transform (FFT) methods to efficiently calculate small‐angle scattering (SAS) profiles from large morphological models. These methods enable calculation of SAS from complex nanoscale morphologies commonly encountered in modern polymeric and nanoparticle‐based systems which have no exact analytical representation and are instead represented digitally using many millions of subunits, so that algorithms with linear or near‐linear scaling are essential. The Monte Carlo method, referred to as the Monte Carlo distribution function method (MC‐DFM), is presented and its accuracy validated using a number of simple morphologies, while the FFT calculations are based on the fastest implementations available. The efficiency, usefulness and inherent limits of DFM and FFT approaches are explored using a series of complex morphological models, including Gaussian chain ensembles and two‐phase three‐dimensional interpenetrating nanostructures.