Strassen's algorithm: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: 2^n) |
(Converted this to a draft task (presumably it's intended to be one?).) |
||
| Line 1: | Line 1: | ||
{{draft task}} |
|||
;Description |
|||
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known algorithms for extremely large matrices. |
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known algorithms for extremely large matrices. |
||
;Task |
|||
Write a routine, function, procedure etc. in your language to implement the Strassen algorithm for matrix multiplication. |
|||
;See also |
|||
:* [[wp:Strassen algorithm|Wikipedia article]] |
|||
=={{header|Julia}}== |
=={{header|Julia}}== |
||