University of Cambridge > > Isaac Newton Institute Seminar Series > Universality in numerical analysis. Cyber algorithms

Universality in numerical analysis. Cyber algorithms

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

CATW03 - Computational complex analysis

 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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity