BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Chebyshev to Zolotarev\, Faber to Ganelius\, and EIM to AAA - Alex
  Townsend (Cornell University)
DTSTART:20191209T133000Z
DTEND:20191209T140000Z
UID:TALK135439@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:In 1854\, Chebyshev derived the Chebyshev polynomials via a mi
 nimax polynomial problem. About 20 years later\, Zolotarev (a student in o
 ne of Chebyshev&#39\;s courses) generalized the minimax problem to one inv
 olving rational functions. These minimax problems are now used to understa
 nd the convergence behavior of Krylov methods\, the decay rate of singular
  values of structured matrices\, and the development of fast PDE solvers. 
 In this talk\, we will survey the computational complex analysis technique
 s that can be used to solve Chebyshev&#39\;s and Zolotarev&#39\;s minimax 
 problems and try to highlight the ongoing connections between polynomials 
 and rationals.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR