Randomized Matrix Computations - Themes and Variations Part 2

Explore a comprehensive lecture that presents a fresh perspective on randomized algorithms for matrix computations, delivered by Joel Tropp from Caltech at the Simons Institute's Complexity and Linear Algebra Boot Camp. Discover the distinct ways probability can be leveraged to design algorithms for numerical linear algebra through various design templates, each illustrated with applications to multiple computational problems. Gain insight into the conceptual foundations of randomized numerical linear algebra while understanding the connections between seemingly unrelated algorithms. Learn from this second part of the "Themes & Variations" series, which draws from detailed lecture notes (arXiv 2402.17873) co-authored with Anastasia Kireeva from ETH, providing both theoretical depth and practical applications in this rapidly evolving field of computational mathematics.