Hierarchical O(N) computation of small-angle scattering profiles and their associated derivatives.

ABSTRACT: The need for fast approximate algorithms for Debye summation arises in computations performed in crystallography, small/wide-angle X-ray scattering and small-angle neutron scattering. When integrated into structure refinement protocols these algorithms can provide significant speed up over direct all-atom-to-all-atom computation. However, these protocols often employ an iterative gradient-based optimization procedure, which then requires derivatives of the profile with respect to atomic coordinates. This article presents an accurate, O(N) cost algorithm for the computation of scattering profile derivatives. The results reported here show orders of magnitude improvement in computational efficiency, while maintaining the prescribed accuracy. This opens the possibility to effici

SUBMITTER: Berlin K 

PROVIDER: S-EPMC3970052 | biostudies-literature | 2014 Apr

REPOSITORIES: biostudies-literature