BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:250666
DTSTAMP:20261106T105613Z
DTSTART;TZID=America/New_York:20261109T130000
DTEND;TZID=America/New_York:20261109T135000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/mathematical-sciences
 -department-discrete-math-seminar-ada-wang-harvard-university
SUMMARY:Mathematical Sciences Department Discrete Math Seminar: Ada Wang\, 
 Harvard University
DESCRIPTION:Speaker: Ada Wang\nTitle: Multi-subspace power method for decom
 posing partially symmetric tensors\nAbstract: We present an algorithm for 
 low rank decomposition of tensors of any symmetry type\, from fully asymme
 tric to fully symmetric. It recovers the decomposition one summand at a ti
 me via the higher-order power method. This approach is known to fail in ge
 neral: there need not be a relationship between the summands of a decompos
 ition and the (partially symmetric) singular vector tuples (pSVTs) of the 
 tensor. Our approach overcomes this problem by transforming the input to a
  tensor with orthonormal slices\, via orthogonalization of a flattening. T
 he summands of the decomposition of the original tensor can be recovered f
 rom the pSVTs of this new transformed tensor. We introduce a shifted power
  method for computing pSVTs and prove its global convergence. Numerical ex
 periments demonstrate that our algorithm achieves higher accuracy and fast
 er runtime than existing methods
END:VEVENT
END:VCALENDAR