On an optimal algorithm for matrix multiplication

MaRDI QIDQ1178429zbMATH OpenFDO

Authors Youcai Xie, Wenlong Ying, Dao-qi Chen

Publication date 26 June 1992

Published in Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

computational complexitynonnegative integer matrix multiplicationnumber of operatorsone multiplication algorithmoptimal algorithm

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Review text

A one multiplication algorithm for nonnegative integer matrix multiplication is presented and it is claimed that the computational complexity of the algorithm is not only depending on the number of operators needed but also essentially depends on the word length of the operands, which is neglected in the paper by \textit{C. Jiang} and \textit{Z. Wu} [ibid. 35, No. 4, 268-272 (1990; Zbl 0697.65038)].

Recommendations

• scientific article; zbMATH DE number 151736
• An optimal algorithm for matrix multiplication
• Publication:4944595

Cited in

(7)

• Algorithm 898
• Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
• scientific article; zbMATH DE number 151736 (Why is no real title available?)
• scientific article; zbMATH DE number 1419996 (Why is no real title available?)
• scientific article; zbMATH DE number 6412845 (Why is no real title available?)
• An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
• An optimal algorithm for matrix multiplication

This page was built for publication: On an optimal algorithm for matrix multiplication

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