BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jan Vybíral (Czech Technical University\, Faculty of Nuclear Scie
 nces and Physical Engineering)
DTSTART:20240417T070000Z
DTEND:20240417T080000Z
DTSTAMP:20260422T122512Z
UID:MathMAC/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MathMAC/12/"
 >Lower bounds in numerical mathematics</a>\nby Jan Vybíral (Czech Technic
 al University\, Faculty of Nuclear Sciences and Physical Engineering) as p
 art of Modelling of materials - theory\, model reduction and efficient num
 erical methods (UNCE MathMAC)\n\n\nAbstract\nIn the analysis of algorithms
 \, there is usually a big difference between upper and lower bounds. Upper
  bounds (on the running time\, memory used or necessary input information)
  is usually achieved by a construction of an efficient algorithm. On the o
 ther hand\, lower bounds show that the construction of better and better a
 lgorithms has some natural limits. We study lower bounds on the amount of 
 input information needed for algorithms in numerical analysis. The problem
 s discussed include numerical integration\, signal processing\, and discre
 te geometry. Naturally\, we encounter connections to functional analysis\,
  probability\, and combinatorics.\n
LOCATION:https://researchseminars.org/talk/MathMAC/12/
END:VEVENT
END:VCALENDAR