Talk:Matrix multiplication algorithm

Numerical stability
This article is still missing information about numerical stability. In fact, this important topic is only briefly mentioned when Strassen's algo is introduced. This article (already cited in the text) might be a starting point. Q VVERTYVS (hm?) 18:42, 17 August 2015 (UTC)

row-major order?
....the above algorithm is sub-optimal for A and B stored in row-major order...

Why? $$sum \leftarrow sum + A_{ik} \times B_{kj}$$

Loop for k in A runs in row by columns, in B runs in column by rows... Jumpow (talk) 13:39, 3 March 2021 (UTC)

Merger proposal
I propose to merge Coppersmith–Winograd algorithm into Matrix multiplication algorithm. The sub-cubic algorithms section contains almost all the information in Coppersmith–Winograd algorithm, and most of the articles that link to Coppersmith–Winograd are either referring to the fastest matrix multiplication algorithm (which is no long Coppersmith-Winograd) or simply any fast matrix multiplication algorithm. I've also seen cases where people don't realize that a matrix multiplication algorithm article exists, and find the article for Coppersmith-Winograd instead.

As another related point, it seems like Computational complexity of matrix multiplication could be made its own article, considering that both Matrix multiplication algorithm and Matrix multiplication contain one section about the usual type of computational complexity of matrix multiplication, with the rest of their articles discussing other things entirely (implementation details and mathematical definitions, respectively). I'm not as sure about this, though. Fawly (talk) 23:02, 30 April 2021 (UTC)


 * I support the merge. Saung Tadashi (talk) 01:27, 1 May 2021 (UTC)

MIT OpenCourseWare hyperlink stale: plug slides or video?
The hyperlink to MIT OpenCourseWare 6.172 has gone stale: plug slides or video? 94.220.51.20 (talk) 07:47, 13 November 2021 (UTC)