This Article 
 Bibliographic References 
 Add to: 
Efficient Complex Matrix Multiplication
July 1988 (vol. 37 no. 7)
pp. 877-879
A well-known algorithm for complex multiplication which requires three real multiplications and five real additions is observed not to require commutativity. The resulting extension of its applicability to complex matrices is examined. The computational savings are shown to approach 1/4. even if a real multiplication is not more computationally costly than a real addition. The computational cos

[1] S. Winograd,Arithmetic Complexity of Computations. Philadelphia, PA: Soc. for Indust. Appl. Mat., SIAM, 1980.
[2] P. S. Moharir, "Extending the scope of Golub's method beyond complex multiplication,"IEEE Trans. Comput., vol. C-34, pp. 484- 487, May 1985.
[3] V. Strassen, "Gaussian elimination is not optimal,"Numer. Math., pp. 354-356, 1969.

Index Terms:
complex matrix multiplication; computational savings; real additions; real multiplication; mathematics computing.
A.T. Fam, "Efficient Complex Matrix Multiplication," IEEE Transactions on Computers, vol. 37, no. 7, pp. 877-879, July 1988, doi:10.1109/12.2236
Usage of this product signifies your acceptance of the Terms of Use.