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:Isaac Newton Institute Seminar Series
SUMMARY:Lecture 1: Some old and new results on Information
-Based Complexity - Erich Novak (Friedrich-Schille
r-Universität Jena)
DTSTART;TZID=Europe/London:20190211T150000
DTEND;TZID=Europe/London:20190211T163000
UID:TALK120133AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/120133
DESCRIPTION:We give a short introduction to IBC and present so
me basic
definitionsand a few results. The gene
ral question is: How many function values (or valu
es of other functionals) of $f$ do we need to comp
ute $S(f)$ up to an error $epsilon$? Here $S(f)$ c
ould be the integral or the maximum of $f$.
In
particular we study the question: Which problems a
re tractable? When do we have the curse of dimensi
on?
In the second talk we discuss complexi
ty results for
numerical integration.
In
particular we present results for the star discre
pancy\,
the curse of dimension for $C^k$ functi
ons\, and results for randomized algorithms
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR