BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261105T132852
DTSTART;TZID=America/Detroit:20261113T150000
DTEND;TZID=America/Detroit:20261113T160000
SUMMARY:Workshop / Seminar:On the Algebra of Moving Window Calculations
DESCRIPTION:Moving window calculations arise throughout applied mathematics\, computer science\, and engineering. Familiar examples include moving sums\, maxima\, and filters\, but the same basic problem also appears in more general windowed recurrences. In this talk\, we show that a large class of such calculations admits a common algebraic formulation. In the associative setting\, moving window calculations can be recast as exponentiation in a semidirect product\, bringing efficient powering algorithms to bear. In more general settings\, semi-associativity provides the right framework for representing compositions of updates and understanding when efficient computation is still possible. This point of view not only unifies a broad family of examples\, but also leads naturally to compact vectorized implementations\, making the methods well suited to modern GPU architectures. This is joint work with David Maslen.
UID:149671-21906924@events.umich.edu
URL:https://events.umich.edu/event/149671
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
END:VCALENDAR