Factorization method for crystallographic Fourier transforms

DOI10.1016/0196-8858(90)90014-PMaRDI QIDQ919792zbMATH OpenOpenAlexFDO

Authors M. An, James W. Cooley, R. Tolimieri

Publication date 1990

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-8858(90)90014-p

zbMATH Keywords

3-dimensional discrete Fourier transformcristallographyfast DFT-algorithmsorbit exchangesymmetrized DFT

Mathematics Subject Classification ID

Other geometric groups, including crystallographic groups (20H15) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Numerical methods for discrete and fast Fourier transforms (65T50)

Review text

Let p,q be primes (p\(\neq q)\) and \(n=pq\). Algorithms for computing the 3- dimensional discrete Fourier transform (DFT) of size \(n\times n\times n\) that take advantage of crystal symmetries are developed. The symmetry of a crystal gives rise to redundancy in the sampled data, i.e., the data are invariant under a space group G of the crystal. The DFT of G- invariant data without redundant arithmetic is called a symmetrized DFT. The main result is the orbit exchange. This is a procedure for designing symmetrized DFT-algorithms of size \(n\times n\times n\) which reduce to symmetrized DFT's on the prime factors of n. Note that fast algorithms for symmetrized DFT of prime size are known.

Recommendations

• scientific article; zbMATH DE number 2087117
• The crystallographic fast Fourier transform. I. p3 symmetry
• Fourier transforms that respect crystallographic symmetries
• The crystallographic fast Fourier transform. Recursive symmetry reduction
• The crystallographic fast Fourier transform. II. One-step symmetry reduction

Cited in

(5)

• Differential factorization method in block structures and nanostructures
• A Parallel Prime Edge-Length Crystallographic FFT
• scientific article; zbMATH DE number 2087117 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004
• Two-dimensional wreath product group-based image processing

This page was built for publication: Factorization method for crystallographic Fourier transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q919792)