BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Mathematics - ECPv5.4.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Mathematics
X-ORIGINAL-URL:https://math.sciences.ncsu.edu
X-WR-CALDESC:Events for Department of Mathematics
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171114T163000
DTEND;TZID=America/New_York:20171114T173000
DTSTAMP:20210307T021310
CREATED:20171006T144321Z
LAST-MODIFIED:20171114T142651Z
UID:10714-1510677000-1510680600@math.sciences.ncsu.edu
SUMMARY:Gleb Pogudin\, Courant Institute of Mathematical Sciences\, Algorithms for Checking Global Identifiability
DESCRIPTION:The following situation arises in modeling: one has a system of differential equations with parameters and wants to determine the values of these parameters measuring unknown functions (assuming that perfect noise-free measurements are possible). Usually\, some of the unknown functions are impossible or very hard to measure\, so only a subset of them is available for measurement. The property of parameters to be uniquely recoverable from measuring a subset of the unknown functions is called structural global identifiability. Several approaches were suggested during last three decades for solving this problem. In this talk\, I will describe recent theoretical results in this area and new efficient algorithms. This is joint work with Hoon Hong\, Alexey Ovchinnikov\, and Chee Yap.
URL:https://math.sciences.ncsu.edu/event/glen-pogudin-cuny-new-york/
LOCATION:SAS 4201
CATEGORIES:Symbolic Computation Seminar
END:VEVENT
END:VCALENDAR