Talk:Matrix multiplication algorithm

Computing Low‑importance

	This 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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.

Computer science Mid‑importance

This 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

The contents of Cache-oblivious matrix multiplication was merged into Matrix multiplication algorithm. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. For the discussion at that location, see its talk page.

The contents of Coppersmith–Winograd algorithm was merged into Matrix multiplication algorithm on May 20, 2021. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. For the discussion at that location, see its talk page.

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

Merger proposal

The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.

The result of this discussion was merge.

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]

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

The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.

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

Winograd's cubic algorithm

I just learned that Winograd's has another algorithm, from before Strassen's that does half the multiplications (It's O(0.5n³))

https://dl.acm.org/doi/10.1109/TC.1968.227420 DDavo (talk) 08:05, 23 May 2025 (UTC)[reply]