Coppersmith–Winograd algorithm

In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known matrix multiplication algorithm from 1990 until 2010. It can multiply two [math]\displaystyle{ n \times n }[/math] matrices in [math]\displaystyle{ \mathcal{O}(n^{2.375477}) }[/math] time (see Big O notation).

This is an improvement over the naïve [math]\displaystyle{ \mathcal{O}(n^3) }[/math] time algorithm and the [math]\displaystyle{ \mathcal{O}(n^{2.807355}) }[/math] time Strassen algorithm. Algorithms with better asymptotic running time than the Strassen algorithm are rarely used in practice, because the large constant factors in their running times make them impractical. It is possible to improve the exponent further; however, the exponent must be at least 2 (because there are [math]\displaystyle{ n \times n = n^2 }[/math] values in the result which must be computed).

In 2010, Andrew Stothers gave an improvement to the algorithm, [math]\displaystyle{ \mathcal{O}(n^{2.374}). }[/math] In 2011, Virginia Vassilevska Williams combined a mathematical short-cut from Stothers' paper with her own insights and automated optimization on computers, improving the bound to [math]\displaystyle{ \mathcal{O}(n^{2.3728642}). }[/math] In 2014, François Le Gall simplified the methods of Williams and obtained an improved bound of [math]\displaystyle{ \mathcal{O}(n^{2.3728639}). }[/math]

The Coppersmith–Winograd algorithm is frequently used as a building block in other algorithms to prove theoretical time bounds. However, unlike the Strassen algorithm, it is not used in practice because it only provides an advantage for matrices so large that they cannot be processed by modern hardware (making it a galactic algorithm).

Henry Cohn, Robert Kleinberg, Balázs Szegedy and Chris Umans have re-derived the Coppersmith–Winograd algorithm using a group-theoretic construction. They also showed that either of two different conjectures would imply that the optimal exponent of matrix multiplication is 2, as has long been suspected. However, they were not able to formulate a specific solution leading to a better running-time than Coppersmith–Winograd. Several of their conjectures have since been disproven by Blasiak, Cohn, Church, Grochow, Naslund, Sawin, and Umans using the Slice Rank method.

See also

• Computational complexity of mathematical operations
• Gauss–Jordan elimination
• Salem–Spencer set
• Strassen algorithm

Further reading

• Bürgisser, P.; Clausen, M.; Shokrollahi, M. A. (1997). Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften. 315. Springer Verlag. ISBN 3-540-60582-7.