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.
Keywords
ComputationAlgorithmComputer scienceScalar (mathematics)Fourier transformReduction (mathematics)Fast Fourier transformTransformation (genetics)Computational scienceParallel computingMathematicsGeometryChemistry
Related Publications
The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modified periodograms
The use of the fast Fourier transform in power spectrum analysis is described. Principal advantages of this method are a reduction in the number of computations and in required ...
A new least-squares refinement technique based on the fast Fourier transform algorithm
A new atomic-parameters least-squares refinement method is presented which makes use of the fast Fourier transform algorithm at all stages of the computation. For large structur...
Factor Analysis: An Applied Approach
Contents: Preface. Introduction and Spearman Approach. Centroid Method Rotation in Two Dimensions. Elements of Matrix Algebra. Linear Computations. The Principal-Axes Method. Ro...
<i>REFMAC</i>5 for the refinement of macromolecular crystal structures
This paper describes various components of the macromolecular crystallographic refinement program REFMAC5, which is distributed as part of the CCP4 suite. REFMAC5 utilizes diffe...
Bulk-solvent and overall scaling revisited: faster calculations, improved results
A fast and robust method for determining the parameters for a flat (mask-based) bulk-solvent model and overall scaling in macromolecular crystallographic structure refinement an...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 45
- Issue
- 1
- Pages
- 42-50
- Citations
- 38
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
38
OpenAlex
Cite This
Axel T. Brünger
(1989).
A memory-efficient fast Fourier transformation algorithm for crystallographic refinement on supercomputers.
Acta Crystallographica Section A Foundations of Crystallography
, 45
(1)
, 42-50.
https://doi.org/10.1107/s0108767388009183
Identifiers
- DOI
- 10.1107/s0108767388009183