Parallelization of fast Fourier transforms
From MaRDI portal
basic linear algebra communication subroutinesfast Fourier transformshigh performance scalable computingimage processingparallel computationparallelization algorithmscientific computingspectral methods
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Computing methodologies for image processing (68U10)
Recommendations
Cited in
(16)- FFT algorithms and their adaptation to parallel processing
- Real and complex fast Fourier transforms on the Fujitsu VPP 500
- Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- PFFT: An extension of FFTW to massively parallel architectures
- scientific article; zbMATH DE number 5926078 (Why is no real title available?)
- A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs
- Adaptive matrix transpose algorithms for distributed multicore processors
- scientific article; zbMATH DE number 3942982 (Why is no real title available?)
- scientific article; zbMATH DE number 2040841 (Why is no real title available?)
- A PARALLEL FAST FOURIER TRANSFORM
- Improved Twiddle Access for Fast Fourier Transforms
- scientific article; zbMATH DE number 3997125 (Why is no real title available?)
- Fast Fourier Transform (FFT) on GPUs
- Scalable parallel FFT for spectral simulations on a Beowulf cluster
- Parallel computations for Yau filters
This page was built for publication: Parallelization of fast Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760267)
