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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Randomized sketching of Krylov methods in numerical linear algebra

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Room 2 in the gatehouse at INI. MR2, DAMTP Goldsmiths 2 & https://us06web.zoom.us/j/81688365420?pwd=b3RpdHgxNVhWbWQrbXluMUxYNWVtQT09 Meeting ID: 816 8836 5420 Passcode: 047859

Other talks

Organiser Welcome César Milstein Lecture - Title TBC Gastroenterology and Acute Medicine Evolution: Inevitable or Remarkable? Grand Rounds - Equine  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response 
 

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