Accession Number:

ADA179861

Title:

Efficient Complex Matrix Multiplication.

Descriptive Note:

Final technical rept. Dec 85-Jan 87,

Corporate Author:

STATE UNIV OF NEW YORK AT BUFFALO AMHERST

Personal Author(s):

Report Date:

1987-03-01

Pagination or Media Count:

10.0

Abstract:

A well known algorithm for complex multiplication which requires three real multiplications and five real additions is observed not to require commutativity. This extends its applicability to complex matrices as examined in this report. The computational savings are shown to approach 14, even if a real multiplication is not more computationally costly than a real addition. The computational cost function used is based on the number of equivalent real additions, with every real multiplication counted as equivalent to real additions. Author

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE