MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Can we multiply matrices faster by exploiting symmetry?

Joseph Landsberg
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, RG1, MMCI  
AG Audience
English

Date, Time and Location

Thursday, 1 June 2017
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

In 1969 Strassen showed the standard algorithm for multiplying nxn matrices is not optimal. Since then there has been intense interest in determining just how fast matrices can be multiplied. It is even conjectured that asymptotically, as n goes to infinity, one can multply nxn matrices nearly as fast as one can add them. I will describe a new approach to this problem via symmetry (representation theory).

This is joint work with G. Ballard, A. Conner, J. Hauenstein, C. Ikenmeyer and N. Ryder.

Contact

Christian Ikenmeyer
--email hidden
passcode not visible
logged in users only

Christian Ikenmeyer, 05/31/2017 00:50
Christian Ikenmeyer, 05/12/2017 17:46 -- Created document.