Fast Fourier Transform Algorithms for Parallel Computers
From MaRDI portal
Publication:5230478
DOI10.1007/978-981-13-9965-7zbMATH Open1477.65005OpenAlexW2977289290MaRDI QIDQ5230478
Publication date: 22 August 2019
Published in: High-Performance Computing Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-13-9965-7
Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items (11)
A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing ⋮ Title not available (Why is that?) ⋮ FFT algorithms and their adaptation to parallel processing ⋮ Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors ⋮ Title not available (Why is that?) ⋮ A parallel FFT algorithm for transputer networks ⋮ Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions ⋮ Title not available (Why is that?) ⋮ FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2 ⋮ Liszt's Ètude S.136 no.1: audio data analysis of two different piano recordings ⋮ Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
This page was built for publication: Fast Fourier Transform Algorithms for Parallel Computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230478)
