|
|
|
|
|
Strassen AlgorithmIn 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. History Volker Strassen published the Strassen algorithm in 1969 and although his algorithm is only slightly faster than the standard algorithm for matrix multiplication, he was the first to point out that Gaussian elimination was not optimal. His paper started the search for even faster algorithms (e.g. Coppersmith-Winograd algorithm). Algorithm Let A, B be two square matrices over a field K. We want to calculate the matrix product C as -
If the matrices A, B are not of type 2n x 2n we fill the missing rows and columns with zeros. We partition A, B and C into equally sized block matrices -
\mathbf{A} = \begin{bmatrix} \mathbf{A}_{1,1} & \mathbf{A}_{1,2} \\ \mathbf{A}_{2,1} & \mathbf{A}_{2,2} \end{bmatrix} \mbox { , } \mathbf{B} = \begin{bmatrix} \mathbf{B}_{1,1} & \mathbf{B}_{1,2} \\ \mathbf{B}_{2,1} & \mathbf{B}_{2,2} \end{bmatrix} \mbox { , } \mathbf{C} = \begin{bmatrix} \mathbf{C}_{1,1} & \mathbf{C}_{1,2} \\ \mathbf{C}_{2,1} & \mathbf{C}_{2,2} \end{bmatrix} with -
then -
-
-
-
With this construction we have not reduced the number of multiplications. We still need 8 multiplications to calculate the Ci,j matrices, the same number of multiplications we need when using standard matrix multiplication. Now comes the important part. We define new matrices -
-
-
-
-
-
-
which are then used to express the Ci,j in terms of Mk. Because of our definition of the Mk we can eliminate one matrix multiplication and reduce the number of multiplications to 7 (one multiplications for each Mk) and express the Ci,j as -
-
-
-
We iterate this division process n-times until the submatrices degenerate into numbers. Numerical analysis The standard matrix multiplications takes -
multiplications of the elements in the field K. We ignore the additions needed because, depending on K, they can be much faster than the multiplications in computer implementations, especially if the sizes of the matrix entries exceed the word size of the machine. With the Strassen algorithm we can reduce the number of multiplications to - .
External links References - Strassen, Volker, Gaussian Elimination is not Optimal, Numer. Math. 13, p. 354-356, 1969
|
 |
| |
|
|