Fastest Matrix Multiply Algorithm       


Mathematics Accomplishment | 1990

IBM researchers: Don Coppersmith, Shmuel Winograd

Where the work was doneIBM T.J. Watson Research Center

What we accomplished: Also known as Fast Matrix Multiply, the Coppersmith-Winograd Algorithm was the asymptotically fastest known algorithm for square matrix multiplication until 2010 when improved variants of Coppersmith-Winograd surfaced.

Related links: Coppersmith–Winograd Algorithm on Wikipedia; Matrix Multiplication via Arithmetic Progressions

BACK TO MATHEMATICS

BACK TO IBM RESEARCH ACCOMPLISHMENTS