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
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
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...
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.