University of Cambridge > Talks.cam > Applied and Computational Analysis > An Introduction to Randomized Algorithms for Matrix Computations

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

An Introduction to Randomized Algorithms for Matrix Computations

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

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

This is a joint ACA–CCIMI seminar

The emergence of massive data sets, over the past twenty or so years, has lead to the development of Randomized Numerical Linear Algebra. Fast and accurate randomized matrix algorithms are being designed for applications in machine learning, population genomics, astronomy, nuclear engineering, and optimal experimental design.

We give a flavour of randomized algorithms for the solution of least squares/regression problems. Along the way we illustrate important concepts from numerical analysis (conditioning and pre-conditioning), probability (concentration inequalities), and statistics (sampling and leverage scores).

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Mordell Lectures Computer Laboratory Opera Group Seminars Wednesday Lunch Time Seminar Series

Other talks

Brain tumours: demographics, presentation, diagnosis, treatment Melville Mini-symposium: Programming materials with classical conditioning algorithms There be monsters: adaptations in Antarctic marine animals The emergence of cognitive ability in childhood Openness and Deference: The Role of Awe in Scientific and Religious Practice Carbon accounts and inclusive wealth under globalization
 

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