Premium
Comparison of iterative desmearing procedures for one‐dimensional small‐angle scattering data
Author(s) -
Vad Thomas,
Sager Wiebke F. C.
Publication year - 2011
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/s0021889810049721
Subject(s) - convergence (economics) , collimated light , algorithm , simple (philosophy) , noise (video) , resolution (logic) , filter (signal processing) , small angle scattering , scattering , computational physics , physics , spheres , optics , computer science , laser , philosophy , epistemology , astronomy , artificial intelligence , economics , image (mathematics) , computer vision , economic growth
Two simple iterative desmearing procedures – the Lake algorithm and the Van Cittert method – have been investigated by introducing different convergence criteria using both synthetic and experimental small‐angle neutron scattering data. Implementing appropriate convergence criteria resulted in stable and reliable solutions in correcting resolution errors originating from instrumental smearing, i.e. finite collimation and polychromaticity of the incident beam. Deviations at small momentum transfer for concentrated ensembles of spheres encountered in earlier studies are not observed. Amplification of statistical errors can be reduced by applying a noise filter after desmearing. In most cases investigated, the modified Lake algorithm yields better results with a significantly smaller number of iterations and is, therefore, suitable for automated desmearing of large numbers of data sets.