Two dimensional fast Fourier transform for large data matrices

DOI10.1016/0010-4655(89)90108-2MaRDI QIDQ1330618zbMATH OpenOpenAlexFDO

Authors Mulugeta H. Serzu, Wooil M. Moon

Publication date 30 October 1994

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

Full work available at URL https://doi.org/10.1016/0010-4655(89)90108-2

zbMATH Keywords

Cooley- Tukey algorithmfast Fourier transformFortran programlarge data matrices

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 494440
• Fast Fourier transforms for nonequispaced data. II
• 2-D FFT algorithm by matrix factorization in a 2-D space
• Fast Fourier Transforms for Nonequispaced Data
• scientific article; zbMATH DE number 1284007
• Fast Fourier transform using matrix decomposition
• scientific article; zbMATH DE number 4013982
• scientific article; zbMATH DE number 2201978
• scientific article; zbMATH DE number 3885286
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)

Cites work

• A Fast Computer Method for Matrix Transposing
• A stepwise approach to computing the multidimensional fast Fourier transform of large arrays
• scientific article; zbMATH DE number 3584892 (Why is no real title available?)

Describes a project that uses

Uses Software

• SW2DFFT

This page was built for publication: Two dimensional fast Fourier transform for large data matrices

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