Talk:Matrix multiplication algorithm: Difference between revisions

Revision as of 00:28, 21 May 2021

Latest revision as of 08:05, 23 May 2025

(3 intermediate revisions by 3 users not shown)

Line 1:

{{WikiProject Computingbanner shell|class=C |importance=Low}}

{{WikiProject Computer scienceComputing |importance=Mid |class=CLow}}

{{WikiProject Computer science |importance=Mid }}

}}

{{merged from|Cache-oblivious matrix multiplication}}

{{merged-from|Coppersmith–Winograd algorithm|May 20, 2021}}

{{WikiProject Computing |class=C |importance=Low}}

{{WikiProject Computer science |importance=Mid |class=C}}

== Numerical stability ==

Line 24 ⟶ 27:

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

{{Discussion bottom}}

== MIT OpenCourseWare hyperlink stale: plug slides or video? ==

The hyperlink to <em>MIT OpenCourseWare 6.172</em> has gone stale:<br/>

plug [https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-172-performance-engineering-of-software-systems-fall-2018/lecture-slides/MIT6_172F18_lec1.pdf slides] or video?

[[Special:Contributions/94.220.51.20|94.220.51.20]] ([[User talk:94.220.51.20|talk]]) 07:47, 13 November 2021 (UTC)

== 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 [[User:DDavo|DDavo]] ([[User talk:DDavo|talk]]) 08:05, 23 May 2025 (UTC)