Jump to content

Talk:Matrix multiplication algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fawly (talk | contribs) at 23:05, 30 April 2021 (add tag). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing C‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the project's importance scale.
WikiProject iconComputer science C‑class Mid‑importance
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

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. QVVERTYVS (hm?) 18:42, 17 August 2015 (UTC)[reply]

row-major order?

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

Why?

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)[reply]

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)[reply]