skip to content
 

Chebyshev to Zolotarev, Faber to Ganelius, and EIM to AAA

Presented by: 
Alex Townsend Cornell University
Date: 
Monday 9th December 2019 - 13:30 to 14:00
Venue: 
INI Seminar Room 1
Abstract: 
In 1854, Chebyshev derived the Chebyshev polynomials via a minimax polynomial problem. About 20 years later, Zolotarev (a student in one of Chebyshev's courses) generalized the minimax problem to one involving rational functions. These minimax problems are now used to understand 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 techniques that can be used to solve Chebyshev's and Zolotarev's minimax problems and try to highlight the ongoing connections between polynomials and rationals.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons