Matrix Multiplication in Sub-Cubic Runtime by William Burford '20, Monday, September 30
Mon, September 30th, 2019
1:00 pm - 1:45 pm
- This event has passed.
Matrix Multiplication in Sub-Cubic Runtime by William Burford ’20, Monday, September 30, 1 – 1:45 pm, Stetson Court Classroom 110, Mathematics Colloquium
Abstract: Matrix multiplication is used in countless real world applications including medical imaging, computer graphics, and machine learning. The naive algorithm for nxn matrix multiplication takes on the order of n^3 time, which often makes it a bottleneck, especially when the matrices involved are large. In this talk, we will explore this naive approach, algorithms that improve its runtime, and the theoretical limits of these algorithms.