21 lines
911 B
Plaintext
21 lines
911 B
Plaintext
;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.
|
|
|
|
|
|
;Task
|
|
Write a routine, function, procedure etc. in your language to implement the Strassen algorithm for matrix multiplication.
|
|
|
|
While practical implementations of Strassen's algorithm usually switch to standard methods of matrix multiplication for small enough sub-matrices (currently anything less than 512×512 according to Wikipedia), for the purposes of this task you should not switch until reaching a size of 1 or 2.
|
|
|
|
|
|
;Related task
|
|
:* [[Matrix multiplication]]
|
|
|
|
|
|
;See also
|
|
:* [[wp:Strassen algorithm|Wikipedia article]]
|
|
<br><br>
|
|
|