Strassen's Algorithm: Difference between revisions

No edit summary
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to [[Winograd's Algorithm|Winograd's]] 18), yielding O(n<sup>2.81</sup>) asymptotic performance at the cost of some numeric stability.
A matrix multiplication algorithm yielding O(n<sup>2.81</sup>) asymptotic performance at the cost of some numeric stability and increased memory consumption.
 
==See also==
* [[Winograd's Algorithm]]


[[Category: Computer Science Eponyms]]
[[Category: Computer Science Eponyms]]