Abstract
The Beevers-Lipson procedure was developed as an economical evaluation of Fourier maps in two- and three-dimensional space. Straightforward generalization of this procedure towards a transformation in n-dimensional space would lead to n nested loops over the n coordinates, respectively, and different computer code is required for each dimension. An algorithm is proposed based on the generalization of the Beevers-Lipson procedure towards transforms in n-dimensional space that contains the dimension as a variable and that results in a single piece of computer code for arbitrary dimensions. The computational complexity is found to scale as N log(N), where N is the number of pixels in the map, and it is independent of the dimension of the transform. This procedure will find applications in the evaluation of Fourier maps of quasicrystals and other aperiodic crystals, and in the maximum-entropy method for aperiodic crystals.
Sign-in/Register to access full text options 
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.
