University of Cambridge > > Isaac Newton Institute Seminar Series > Chebyshev to Zolotarev, Faber to Ganelius, and EIM to AAA

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

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

CATW03 - Computational complex analysis

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity