EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗

DOI10.1080/10637199408915457zbMath1049.68867OpenAlexW2021137470MaRDI QIDQ4820037

Cevdet Aykanat, Argun Derviş

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/25981

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Numerical methods for discrete and fast Fourier transforms (65T50) Computer system organization (68M99)

Cites Work

• Multiprocessor FFTs
• FFT algorithms for vector computers
• An Algorithm for the Evaluation of Finite Trigonometric Series
• Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
• The Relationship Between Two Fast Fourier Transforms

This page was built for publication: EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗