The crystallographic fast Fourier transform. Recursive symmetry reduction
From MaRDI portal
Publication:5359255
Recommendations
- The crystallographic fast Fourier transform. II. One-step symmetry reduction
- The crystallographic fast Fourier transform. III. Centred lattices
- The crystallographic fast Fourier transform. IV. FFT-asymmetric units in the reciprocal space
- The crystallographic fast Fourier transform. I. \(p3\) symmetry
- Fast Fourier transforms for space groups containing rotation axes of order three and higher
Cited in
(14)- Fast Fourier transforms for space groups containing rotation axes of order three and higher
- scientific article; zbMATH DE number 2087117 (Why is no real title available?)
- A novel algorithm for calculation of Fourier and asymmetric units
- Fast Fourier transform on FCC and BCC lattices with outputs on FCC and BCC lattices respectively
- Factorization method for crystallographic Fourier transforms
- The crystallographic fast Fourier transform. I. \(p3\) symmetry
- On discrete groups of Euclidean isometries: representation theory, harmonic analysis and splitting properties
- Evaluating finite Fourier transforms that respect group symmetries
- Fourier transforms that respect crystallographic symmetries
- A Parallel Prime Edge-Length Crystallographic FFT
- A direct phasing method based on the origin-free modulus sum function and the FFT algorithm. XII
- The crystallographic fast Fourier transform. II. One-step symmetry reduction
- The crystallographic fast Fourier transform. III. Centred lattices
- The crystallographic fast Fourier transform. IV. FFT-asymmetric units in the reciprocal space
This page was built for publication: The crystallographic fast Fourier transform. Recursive symmetry reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359255)