Location: Room 05.001, Spiegelgasse 5, 4051 Basel
Randomized algorithms are becoming increasingly popular in matrix computations. Recent software efforts, such as RandLAPACK, demonstrate that randomization is on the verge of replacing existing deterministic techniques for several large-scale linear algebra tasks in scientific computing. The poster child of these developments, randomized SVD, is now one of the state-of-the-art approaches for performing low-rank approximation. In this talk, we will go beyond the randomized SVD and illustrate the great potential of randomization to not only speed up existing algorithms, but to also yield novel and often simple algorithms for solving notoriously difficult problems. Examples covered in this talk include reduced order modeling, acceleration of Krylov subspace methods, joint diagonalization, large null space computation, spectral density estimation, and tensor structured randomness. A common theme of these developments is that randomization helps transform linear algebra results that only hold generically into robust and reliable numerical algorithms. To a large extent, this talk reflects the themes covered in the recent Acta Numerica survey https://arxiv.org/abs/2610.38157 , co-authored with Ethan Epperly and Yuji Nakatsukasa.
For further information about the seminar, please visit this webpage.
Export event as iCal