Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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 illustrated with applications to multiple computational problems. Learn how this treatment establishes conceptual foundations for randomized numerical linear algebra while forging connections between seemingly unrelated algorithms. Access the accompanying lecture notes (arXiv 2402.17873) co-authored with Anastasia Kireeva from ETH to deepen your understanding of these innovative approaches to matrix computations.
