Parallelization of fast Fourier transforms

zbMATH Open0988.65126MaRDI QIDQ2760267

P. Bennett

Publication date: 22 July 2002

zbMATH Keywords

image processingfast Fourier transformsparallel computationscientific computingspectral methodsparallelization algorithmbasic linear algebra communication subroutineshigh performance scalable computing

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) 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)

Related Items (9)

Title not available (Why is that?) ⋮ Improved Twiddle Access for Fast Fourier Transforms ⋮ FFT algorithms and their adaptation to parallel processing ⋮ Title not available (Why is that?) ⋮ Parallel 3-dim fast Fourier transforms with load balancing of the plane waves ⋮ Title not available (Why is that?) ⋮ Scalable parallel FFT for spectral simulations on a Beowulf cluster ⋮ Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform ⋮ 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)