Matrix Multiplication and Fast Fourier Transforms
- 8 July 1968
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 47 (6), 1099-1103
- https://doi.org/10.1002/j.1538-7305.1968.tb00074.x
Abstract
Factoring a matrix and multiplying successively by the factors can sometimes be used to speed up matrix multiplications. This is, in fact, the trick which creates the fantastic gains of the fast Fourier transform.Keywords
This publication has 1 reference indexed in Scilit:
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965