In-place self-sorting fast Fourier transform algorithm with local memory references

DOI10.1016/S0010-4655(97)00116-1zbMath0941.65151MaRDI QIDQ1299629

José M. Pérez-Jordá

Publication date: 30 August 1999

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

distributed memory parallel computerslocality of referencein-place algorithmFFT algorithmfast Fourier transform algorithmin-order algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Fast algorithms through divide- and combine-and-conquer strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-sorting mixed-radix fast Fourier transforms
• Implementation of a self-sorting in-place prime factor FFT algorithm
• A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
• An in-place, in-order prime factor FFT algorithm
• Self-Sorting In-Place Fast Fourier Transforms
• The Fractional Fourier Transform and Applications
• A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $
• On Computing the Discrete Fourier Transform
• Fast Fourier Transforms for Nonequispaced Data
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An Error Analysis for Numerical Differentiation

This page was built for publication: In-place self-sorting fast Fourier transform algorithm with local memory references