Toward an Optimal Algorithm for Matrix Multiplication

Sara Robinson

Ever since the dawn of the computer age, researchers have been trying to find an optimal way of multiplying matrices, a fundamental operation that is a bottleneck for many important algorithms. Faster matrix multiplication would give more efficient algorithms for many standard linear algebra problems, such as inverting matrices, solving systems of linear equations, and finding determinants. Even some basic graph algorithms run only as fast as matrix multiplication.

• Download this PDF [51K]
• See more news from this issue

Donate · Contact Us · Site Map · Join SIAM · My Account