Strassen algorithm

Uncommon card · No. 149994

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 for large matrices, with a better asymptotic complexity ( O ( n log 2 ⁡ 7 ) {\displaystyle O(n^{\log _{2}7})} versus O ( n 3 ) {\displaystyle O(n^{3})} ), although the naive algorithm is often better for smaller matrices. The Strassen algorithm is slower than the fastest known algorithms for extremely large matrices, but such galactic algorithms are not useful in practice, as they are much slower for matrices of practical size. For small matrices, highly optimized implementations...

Read on Wikipedia