A Fast Fourier Transform Algorithm Using Base 8 Iterations

DOI10.2307/2004656zbMATH Open0165.51504OpenAlexW4232484159MaRDI QIDQ5551900FDOQ5551900

Authors: G. D. Bergland 

Publication date: 1968

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2004656

zbMATH Keywords

numerical analysis

Cited In (8)

• A fast Poisson solver for realistic semiconductor device structures
• Computing the Fast Fourier Transform on a Vector Computer
• Fast Fourier transforms with recursively generated trigonometric functions
• A note on prime factor FFT algorithms
• Fast Fourier transformation based on number theoretic transforms
• Fast algorithms for the conjugate periodic function
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
• HYDRO\(_ -\)GEN: A spatially distributed random field generator for correlated properties

This page was built for publication: A Fast Fourier Transform Algorithm Using Base 8 Iterations

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