In crystallography one has to compute finite Fourier transforms that are often very large and often respect crystallographic symmetries. In this paper we discuss efficient finite Fourier transform algorithms on 5×5×5 points that respect a collection of crystallographic symmetries. Although the size is too small for any practical problems, the methods indicated in this paper can be extended to problems of meaningful size.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.