Parallel Compact FFT<scp>s</scp> for Real Sequences

DOI10.1137/0914056MaRDI QIDQ3140146zbMATH OpenOpenAlexFDO

Authors Richard B. Pelz

Publication date 20 December 1993

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0914056

zbMATH Keywords

computational complexityfast Fourier transformminimal communication costsmultiprocessorsparallel algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 991433
• Parallel FFT algorithms for mimd computers
• Publication:4860112
• scientific article; zbMATH DE number 4100582
• FFT algorithms and their adaptation to parallel processing

Cited in

(7)

• Real and complex fast Fourier transforms on the Fujitsu VPP 500
• A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods
• scientific article; zbMATH DE number 991433 (Why is no real title available?)
• Fast Fourier transform algorithms for real and symmetric data
• scientific article; zbMATH DE number 4100582 (Why is no real title available?)
• scientific article; zbMATH DE number 97099 (Why is no real title available?)
• scientific article; zbMATH DE number 833643 (Why is no real title available?)

This page was built for publication: Parallel Compact FFT<scp>s</scp> for Real Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140146)