|Location:||MSRI: Simons Auditorium, Online/Virtual|
Universality in Numerical Computation with Random Data Case Studies- Part 1
Universality in Numerical Computation with Random Data Case Studies- Part 2
To participate in this seminar, please register HERE.
Iterative algorithms with random data display universality in the sense that the number of iterations required to obtain a desired accuracy, is universal, independent of the ensemble for the random data. The speakers will describe many different examples of this phenomenon.
2:00 - 3:00 Percy Deift
3:00 - 3:30 Tea
3:30 - 4:30 Thomas Trogdon
This is joint work with T.Trogdon. G.Menon and S.OlverNo Notes/Supplements Uploaded