Matrix identities of the fast Fourier transform
From MaRDI portal
Cites work
- A prime factor FFT algorithm using high-speed convolution
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Average running time of the fast Fourier transform
- Evaluating Polynomials at Fixed Sets of Points
- scientific article; zbMATH DE number 3155184 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3577138 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- On Computing the Discrete Fourier Transform
- The Relationship Between Two Fast Fourier Transforms
Cited in
(12)- Winograd's Fourier transform via circulants
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
- Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm
- Morphisms of Butson classes
- Shuffling matrices, Kronecker product and discrete Fourier transform
- An integral equation model for PET imaging
- Perron similarities and the nonnegative inverse eigenvalue problem
- On the wreath product of signed and gain graphs and its spectrum
- Maximal determinants of matrices over the roots of unity
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- The NEPS of gain graphs over arbitrary groups and its spectra
- Displacement operator based decompositions of matrices using circulants or other group matrices
This page was built for publication: Matrix identities of the fast Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153410)
