An Adaptation of the Fast Fourier Transform for Parallel Processing

DOI10.1145/321450.321457MaRDI QIDQ5551898zbMATH OpenOpenAlexDBLPWikidataFDO

Authors M. C. III Pease

Publication date 1968

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321450.321457

zbMATH Keywords

numerical analysis

Cited in

(28)

• Self-sorting mixed-radix fast Fourier transforms
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
• Matrix structures in parallel matrix computations
• Matrix identities of the fast Fourier transform
• Trends in systolic and cellular computation
• Multilinear algebra and parallel programming
• Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
• Parallel solution of Toeplitzlike linear systems
• Parallel Poisson and biharmonic solvers
• Parallel direct linear system solvers - a survey
• Improved parallel computations with Toeplitz-like and Hankel-like matrices
• Time-dependent solution of the Liouville-von Neumann equation: Non-dissipative evolution
• On vectorizing the fast fourier transform
• Parallel computations in linear algebra
• A Vector Implementation of the Fast Fourier Transform Algorithm
• Computing the Fast Fourier Transform on a Vector Computer
• PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• A high-performance fast Fourier transform algorithm for the Cray-2
• Roundoff Error Analysis of the Fast Fourier Transform
• Generating formally verified quantum Fourier transform algorithms
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices
• Spectral and computational properties of band symmetric Toeplitz matrices
• Calculation scheme based on a weighted primitive: application to image processing transforms
• A complexity theory of efficient parallel algorithms
• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers

This page was built for publication: An Adaptation of the Fast Fourier Transform for Parallel Processing

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