A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $

DOI10.1137/0913039zbMath0756.65163OpenAlexW2012363129WikidataQ56564089 ScholiaQ56564089MaRDI QIDQ3992213

Clive Temperton

Publication date: 13 August 1992

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

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

zbMATH Keywords

Cooley-Tukey algorithmprime factor algorithmself-sortingin-placeprime factor fast Fourier transform

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

Comparing coarray Fortran (CAF) with MPI for several structured mesh PDE applications ⋮ \textit{Semtex}: a spectral element-Fourier solver for the incompressible Navier-Stokes equations in cylindrical or Cartesian coordinates ⋮ Gpfaft ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references

This page was built for publication: A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $