Explore the field of Randomized Numerical Linear Algebra (RandNLA) in this 32-minute lecture by Petros Drineas from Purdue University. Delve into the fundamentals of RandNLA, understanding its importance and applications in modern computational mathematics. Learn about column and row sampling techniques, approximation methods for matrix products, and error bounds in Frobenius and spectral norms. Discover algorithms for solving least-squares problems and computing leverage scores for tall and thin matrices. Examine various approaches to Singular Value Decomposition (SVD) in RandNLA, including early methods, subspace iteration, and Krylov subspace techniques. Conclude with an overview of element-wise sampling and its leverage scores, gaining a comprehensive understanding of this powerful tool in numerical linear algebra.