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.
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.
Source: Wikipedia "Strassen algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky