Issue No. 07 - July (1988 vol. 37)

ISSN: 0018-9340

pp: 877-879

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2236

ABSTRACT

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

INDEX TERMS

complex matrix multiplication; computational savings; real additions; real multiplication; mathematics computing.

CITATION

A.T. Fam, "Efficient Complex Matrix Multiplication",

*IEEE Transactions on Computers*, vol. 37, no. , pp. 877-879, July 1988, doi:10.1109/12.2236