BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d494c41e4c4
DTSTART;TZID=America/Toronto:20181221T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181221T133000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-symbolic-compu
 tation-finding-nearest-non-trivial
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Seminar • Symbolic Computation — Finding the Nearest\nNon-T
 rivial Smith Normal Form
CLASS:PUBLIC
DESCRIPTION:JOSEPH HARALDSON\, PHD CANDIDATE\n_David R. Cheriton School of 
 Computer Science_\n\nWe consider the problem of computing the nearest matr
 ix polynomial\nwith a non-trivial Smith Normal Form (SNF). This is a non-c
 onvex\noptimization problem where we find a nearby matrix polynomial with\
 nprescribed eigenvalues and associated multiplicity structure in the\ninva
 riant factors.
DTSTAMP:20260407T052316Z
END:VEVENT
END:VCALENDAR