The Community for Technology Leaders
Green Image
An algorithm is presented which enables certain matrix multiplications in a digital computer to be implemented with a considerable savings in storage and computational operations. For NxN matrix vector multiplication (that is a multiplication of a matrix by a vector) a maximum of N Sn-1 r=0 p<inf>r</inf>, storage words are necessary compared to normal full matrix storage requirements of N<sup>2</s
Degrees of freedom, fast Hadamard/Walsh transform, generalized fast transforms, generalized spectral analysis, Kronecker product transforms.
H.C. Andrews, K.L. Caspari, "Degrees of Freedom and Modular Structure in Matrix Multiplication", IEEE Transactions on Computers, vol. 20, no. , pp. 133-141, February 1971, doi:10.1109/T-C.1971.223202
195 ms
(Ver 3.3 (11022016))