Universality in numerical analysis. Cyber algorithms
34 mins 21 secs,
123.90 MB,
WebM
640x360,
30.0 fps,
44100 Hz,
492.47 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Deift, P
Tuesday 10th December 2019 - 09:30 to 10:00 |
|---|
| Created: | 2019-12-10 10:13 |
|---|---|
| Collection: | Complex analysis: techniques, applications and computations |
| Publisher: | Isaac Newton Institute |
| Copyright: | Deift, P |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | It turns out that for a wide variety of numerical algorithms with random data, the stopping times for the algorithms to achieve a given accuracy, have universal fluctuations independent of the ensemble for the random data. The speaker will discuss various experimental and analytical results illustrating universality, with particular emphasis on recent work on universality in cyber algorithms.
This is joint work at various stages with a number of authors, Christian Pfrang, Govind Menon, Sheehan Olver, Steven Miller, and particularly Tom Trogdon. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 498.07 MB | View | Download | |
| WebM * | 640x360 | 492.47 kbits/sec | 123.90 MB | View | Download | |
| iPod Video | 480x270 | 521.9 kbits/sec | 131.24 MB | View | Download | |
| MP3 | 44100 Hz | 249.76 kbits/sec | 62.87 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||