Jump to content

Strassen algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MathMartin (talk | contribs) at 14:14, 2 July 2004 (Initial). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the mathematical discipline of linear algebra, the Strassen algorithm (named after Volker Strassen) is an algorithm used for matrix multiplication. It is faster than the standard matrix muliplication algorithm.