Chebyshev to Zolotarev, Faber to Ganelius, and EIM to AAA
30 mins 7 secs,
98.84 MB,
WebM
640x360,
30.0 fps,
44100 Hz,
448.07 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Townsend, A
Monday 9th December 2019 - 13:30 to 14:00 |
|---|
| Created: | 2019-12-09 14:43 |
|---|---|
| Collection: | Complex analysis: techniques, applications and computations |
| Publisher: | Isaac Newton Institute |
| Copyright: | Townsend, A |
| Language: | eng (English) |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 437.46 MB | View | Download | |
| WebM * | 640x360 | 448.07 kbits/sec | 98.84 MB | View | Download | |
| iPod Video | 480x270 | 521.96 kbits/sec | 115.07 MB | View | Download | |
| MP3 | 44100 Hz | 249.77 kbits/sec | 55.13 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||