Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
From MaRDI portal
(Redirected from Publication:4376254)
Recommendations
- A polymorphic radix-n framework for fast Fourier transforms
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
- Multiple radix fast Fourier transformation based on number theoretic transforms
- MULTIPLY-ADD OPTIMIZED FFT KERNELS
- Very fast computation of the radix-2 discrete Fourier transform
- Fast Fourier transform algorithms for parallel computers
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
- The structure of vector radix fast Fourier transforms
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- scientific article; zbMATH DE number 1267276
Cited in
(7)- Four easy ways to a faster FFT
- Modified FFTs for Fused Multiply-Add Architectures
- MULTIPLY-ADD OPTIMIZED FFT KERNELS
- Theoretical study of the band gap of SrSe and SrTe in GW approximation
- A polymorphic radix-n framework for fast Fourier transforms
- Linear response approach to collective electronic excitations of solids and surfaces
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
This page was built for publication: Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376254)
