skip to content

Universality in numerical analysis. Cyber algorithms

Presented by: 
Percy Deift
Tuesday 10th December 2019 - 09:30 to 10:00
INI Seminar Room 1
 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.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons