Efficient complex matrix multiplication

DOI10.1109/12.2236MaRDI QIDQ3792146zbMATH OpenOpenAlexFDO

Authors Adly T. Fam

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

zbMATH Keywords

complex matrix multiplicationcomputational complexityEfficient algorithms

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1779892
• Implementing high-performance complex matrix multiplication via the 1M method
• Fast algorithms for complex matrix multiplication using surrogates
• Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
• Efficient Matrix Multiplication on SIMD Computers
• A practical algorithm for faster matrix multiplication
• Fast matrix multiplication using coherent configurations
• Reproducible and accurate matrix multiplication
• Fast hybrid matrix multiplication algorithms
• Fast Output-Sensitive Matrix Multiplication

Cited in

(8)

• Efficient computation of the matrix cosine
• Some fast algorithms multiplying a matrix by its adjoint
• scientific article; zbMATH DE number 4151731 (Why is no real title available?)
• Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
• Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
• Multiplication algorithm for multivariate trigonometric series
• Fast matrix multiplication using coherent configurations
• Numerical stability and tensor nuclear norm

This page was built for publication: Efficient complex matrix multiplication

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