Fast algorithms for complex matrix multiplication using surrogates

DOI10.1109/ASSP.1989.28064MaRDI QIDQ3826002zbMATH OpenOpenAlexFDO

Authors Francis T. Connolly, Andrew E. Yagle

Publication date 1989

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/assp.1989.28064

zbMATH Keywords

algorithmcomplex matrix multiplicationcomputational efficiencyGivens rotationssurrogate matrix

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1779892
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• scientific article; zbMATH DE number 4151731
• Some fast algorithms multiplying a matrix by its adjoint
• New fast hybrid matrix multiplication algorithms

Cited in

(6)

• An algorithm for fast multiplication of Pauli numbers
• Efficient complex matrix multiplication
• scientific article; zbMATH DE number 1779892 (Why is no real title available?)
• Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
• Implementing high-performance complex matrix multiplication via the 1M method
• Complex matrix inversion via real matrix inversions

This page was built for publication: Fast algorithms for complex matrix multiplication using surrogates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826002)