The 2M Multiplication Algorithm for Complex Matrices
ACM Transactions on Mathematical Software · 21.10.2026
DOI: 10.1145/3859285 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Mathematical Software, online erschienen am 21.10.2026. Verfasst von Peter Caday. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 24 Literaturangaben.
Abstract (Originalsprache)
Complex matrix multiplication is typically computed using 4 real matrix multiplications (GEMMs) of the same size. The well-known 3M multiplication algorithm reduces this cost to 3 real GEMMs, together with quadratic time pre- and post-processing steps. In this paper, we reduce 3M to 2M for matrices with integer real and imaginary parts, performing complex GEMM with only 2 real GEMMs of the same size, along with quadratic time pre- and post-processing. For floating-point matrices, 2M multiplication combines naturally with the Ozaki-II scheme, yielding a practical, high-performance algorithm for computing a complex floating-point GEMM in roughly twice the time of a real GEMM of the same size. As corollaries, we derive new algorithms for symmetric rank- \(k\) updates ( SYRK / HERK ) that internally use full rectangular GEMMs.
Zitieren
APA
Caday, P. (2026). The 2M Multiplication Algorithm for Complex Matrices. ACM Transactions on Mathematical Software. https://doi.org/10.1145/3859285
Vancouver
Caday P. The 2M Multiplication Algorithm for Complex Matrices. ACM Transactions on Mathematical Software. 2026. doi:10.1145/3859285
BibTeX
@article{Caday2026,
author = {Caday, Peter},
title = {The 2M Multiplication Algorithm for Complex Matrices},
journal = {ACM Transactions on Mathematical Software},
year = {2026},
doi = {10.1145/3859285}
}
EUVIMED