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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Universality in numerical analysis. Cyber algorithms

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Senior Parlour, Gonville & Caius College UTC Cambridge, Robinson Way, Cambridge, CB2 0SZ Average on weekdays: 9225.16377315 kWh

Other talks

Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study Morning Break Title to be confirmed Title to be confirmed TBC Title to be confirmed
 

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