4 ms·

I suppose you mean this? http://ocw.mit.edu/courses/mathematics/18-06sc-linear-algebra-fall-2011/positive-definite-matrices-and-applications/complex-matrices-f

by jordigh 12y ago

I suppose you mean this? http://ocw.mit.edu/courses/mathematics/18-06sc-linear-algebra-fall-2011/positive-definite-matrices-and-applications/complex-matrices-fast-fourier-transform-fft/MIT18_06SCF11_Ses3.2sum.pdf http://ocw.mit.edu/courses/mathematics/18-06sc-linear-algebr... I was a bit confused by your statement. You mean that the FFT can be done by matrix multiplication? I tried to interpret your statement the other way around, that you can somehow transform two matrices before you multiply them, trying to fit it into the convolution theorem, but I couldn't make sense of it that way.

pbsd 12y ago
I was puzzled as well. There is an analogous of the FFT method of multiplying polynomials and integers to the matrix multiplication case [1], but it is not as simple and probably does not belong in an introduction to linear algebra. [1] http://arxiv.org/abs/math/0307321v2 http://arxiv.org/abs/math/0307321v2