BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Applied and Computational Analysis
SUMMARY:Computing the homology of basic semialgebraic sets
- Peter Bürgisser (TU Berlin)
DTSTART;TZID=Europe/London:20180125T150000
DTEND;TZID=Europe/London:20180125T160000
UID:TALK96595AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/96595
DESCRIPTION:We describe a numerical algorithm for computing th
e homology (Betti numbers and torsion coefficients
) of a basic semialgebraic set. The algorithm is n
umerically stable in the sense that the precision
required to guarantee a correct output depends on
the condition number of the data and it is polynom
ially small. Its running time also depends on this
condition but it is bounded by a singly exponenti
al bound on the size of the input out of a vanishi
ngly small set of data. All algorithms previously
proposed for this problem have a complexity which
is doubly exponential (and this is so for almost a
ll data).\n\nThis is joint work with Felipe Cucker
and Pierre Lairez.
LOCATION:MR14\, Centre for Mathematical Sciences
CONTACT:Hamza Fawzi
END:VEVENT
END:VCALENDAR