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

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

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)

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

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)