Year-end Sale % OFF 
Abstract
A vectorizable algorithm for fast computation of structure factors and derivatives during refinement of macromolecular structures is presented. It is based on fast Fourier transformations on subgrids that cover the unit cell of the crystal. The use of subgrids allows reduction of the total memory requirements for the computations without producing large overheads. The algorithm is applicable to all space groups. The performance of the algorithm on a conventional scalar computer as well as on supercomputers is discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Acta Crystallographica Section A Foundations of Crystallography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
