Fourier transforms that respect crystallographic symmetries

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.