BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lecture 1: Some old and new results on Information-Based Complexit
 y - Erich Novak (Friedrich-Schiller-Universität Jena)
DTSTART:20190211T150000Z
DTEND:20190211T163000Z
UID:TALK120133@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:We give a short introduction to IBC and present some basic<br>
 definitionsand a few results. The general question is: How many function v
 alues (or values of other functionals) of $f$ do we need to compute $S(f)$
  up to an error $epsilon$? Here $S(f)$ could be the integral or the maximu
 m of $f$.<br>In particular we study the question: Which problems are tract
 able? When do we have the curse of dimension? <br><br>In the second talk w
 e discuss complexity results for<br>numerical integration.<br><br>In parti
 cular we present results for the star discrepancy\,<br>the curse of dimens
 ion for $C^k$ functions\, and results for randomized algorithms
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR