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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom CMS Seminars from business and industry Collaboration Skills Initiative

Other talks

TBC Mergers all the way down: simulating the origin of globular clusters in a galactic context Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Morning Break Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Formalising mathematics and spectral geometry in Lean
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity