The Fourier matrix is fundamental in discrete Fourier transforms and fast Fourier transforms. We generalize the Fourier matrix, extend the concept of Fourier matrix to higher order Fourier tensor, present the spectrum of the Fourier tensors, and use the Fourier tensor to simplify the high order Fourier analysis.
R N Bracewell. The Fourier Transform and Its Applications. 3rd ed. Boston: McGraw-Hill, 2000
2
P Comon, G H Golub, L H Lim, B Mourrain. Symmetric Tensors and Symmetric Tensor Rank. SCCM Technical Report 06-02. Stanford Univ, 2006
3
J W Cooley, P A W Lewis, P D Welch. Historical notes on the fast Fourier transform. Proc IEEE, 1967, 55(10): 1675–1677 https://doi.org/10.1109/PROC.1967.5959
G C Danielson, C Lanczos. Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids. J Franklin Inst, 1942, 233: 365–380 https://doi.org/10.1016/S0016-0032(42)90767-1
6
W M Gentleman, G Sande. Fast Fourier transforms for fun and profit. In: Fall Joint Computer Conference, Vol 29 of AFIPS Conference Proceedings, Spartan Books, Washington D C. 1966, 563–578
7
G Goertzel. An algorithm for the evaluation of finite trigonometric series. Amer Math Monthly, 1958, 65(1): 34–35 https://doi.org/10.2307/2310304
