- When?
- February 25, 2026 5:00 PM
- Where?
- BB 5161.0105
What?
Algorithms are at the heart of solving any computational problem. For a long time, probabilistic elements in computing were seen as a last-resort solution when deterministic algorithms were too slow. However, in recent years, randomization has been shown to be useful for a range of fundamental linear algebraic tasks, and has entered mainstream numerical linear algebra (NLA). In this talk, we will consider the evolution of randomized NLA and discuss the beautiful connections between probability theory, numerical analysis, and practical computing.
We are looking forward to seeing you in BB 5161.0105 at 17:00 on the 25th of February! There will be free drinks, snacks and beer!