https://nick-black.com/dankwiki/index.php?action=history&feed=atom&title=Winograd%27s_Algorithm 2026-07-11T17:14:50Z Revision history for this page on the wiki MediaWiki 1.46.0 https://nick-black.com/dankwiki/index.php?title=Winograd%27s_Algorithm&diff=1076&oldid=prev 2009-09-30T00:44:46Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw-interface=""> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 00:44, 30 September 2009</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">A matrix multiplication algorithm which replaces one recursive matrix multiplication with 15 matrix additions (compared to [[Strassen's Algorithm|Strassen's]] 18), yielding O(n&lt;sup&gt;2.81&lt;/sup&gt;) asymptotic performance. It's used by [http://www.ics.uci.edu/~fastmm/FMM-Reference/reference.html D'Alberto and Nicolau] in their hybrid-daptive matrix multiplication library, and Craig Douglas in his [http://www.mgnet.org/~douglas/ccd-free-software.html GIMMW].</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">==See Also==</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* The [[Coppersmith-Winograd Algorithm]] for matrix multiplication</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.6887 "GEMMW: A Portable Level 3 Blas Winograd Variant Of Strassen's Matrix-Matrix Multiply Algorithm"] from the January 1994 Journal of Computational Physics.</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category: Computer Science Eponyms]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category: Computer Science Eponyms]]</div></td></tr> <!-- diff cache key wikidb:diff:1.41:old-1075:rev-1076:php=table --> </table>

Dank https://nick-black.com/dankwiki/index.php?title=Winograd%27s_Algorithm&diff=1075&oldid=prev 2009-09-30T00:35:25Z

<p>Created page with &#039;<a href="/dankwiki/index.php?title=Category:Computer_Science_Eponyms" class="mw-redirect" title="Category:Computer Science Eponyms">Category: Computer Science Eponyms</a>&#039;</p> <p><b>New page</b></p><div>[[Category: Computer Science Eponyms]]</div>

Dank