University of Cambridge > > Applied and Computational Analysis > Randomized sketching of Krylov methods in numerical linear algebra

Randomized sketching of Krylov methods in numerical linear algebra

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

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

Many large-scale computations in numerical linear algebra are powered by Krylov methods, including the solution of linear systems of equations, least squares problems, linear and nonlinear eigenvalue problems, matrix functions and matrix equations, etc. We will discuss some recent ideas to speed up Krylov methods for these tasks using randomized sketching, and highlight some of the key challenges for future research.

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.


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