Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Can we multiply matrices faster by exploiting symmetry?
Speaker:Joseph Landsberg
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Thursday, 1 June 2017
Time:13:00
Duration:30 Minutes
Location:Saarbrücken
Building:E1 4
Room:024
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
Name(s):Christian Ikenmeyer
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):

Created by:Christian Ikenmeyer, 05/12/2017 05:46 PMLast modified by:Uwe Brahm/MPII/DE, 06/01/2017 07:01 AM
  • Christian Ikenmeyer, 05/31/2017 12:50 AM
  • Christian Ikenmeyer, 05/12/2017 05:46 PM -- Created document.