Jump to content

Strassen's algorithm: Difference between revisions

m
promoted to (full) task status, added highligting and whitespace.
m (promoted to (full) task status, added highligting and whitespace.)
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.
 
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 submatricessub-matrices (currently anything <less 512x512than &nbsp; 512&times;512 &nbsp; according to wpWikipedia), &nbsp; 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>
 
 
=={{header|Go}}==
Cookies help us deliver our services. By using our services, you agree to our use of cookies.