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:682b86a3f27f6
DTSTART;TZID=America/Toronto:20181221T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181221T133000
URL:/computer-science/events/phd-seminar-symbolic-compu
 tation-finding-nearest-non-trivial
SUMMARY:PhD Seminar • Symbolic Computation — Finding the Nearest\nNon-T
 rivial Smith Normal Form
CLASS:PUBLIC
DESCRIPTION:Summary \n\nJOSEPH HARALDSON\, PHD CANDIDATE\n_David R. Cherito
 n School of Computer Science_\n\nWe consider the problem of computing the 
 nearest matrix polynomial\nwith a non-trivial Smith Normal Form (SNF). Thi
 s is a non-convex\noptimization problem where we find a nearby matrix poly
 nomial with\nprescribed eigenvalues and associated multiplicity structure 
 in the\ninvariant factors.\n 
DTSTAMP:20250519T192939Z
END:VEVENT
END:VCALENDAR