Randomized methods for low-rank approximation of matrices and tensors
- đ¤ Speaker: Yuji Nakatsukasa (University of Oxford) đ Website
- đ Date & Time: Thursday 12 October 2023, 15:00 - 16:00
- đ Venue: Centre for Mathematical Sciences, MR14
Abstract
Among the most exciting recent developments in numerical linear algebra is the advent of randomized algorithms that are fast, scalable, robust, and reliable. Low-rank approximation is among the most significant problems for which randomization has had a significant impact. In this talk I will first review some of the most successful randomized algorithms for low-rank approximation of matrices. I will then turn to tensors, and describe an algorithm RTSMS (Randomized Tucker with single-mode sketching) for an approximate Tucker decomposition. RTSMS only sketches one mode at a time, so the sketch matrices are significantly smaller than alternative approaches, and RTSMS can outperform existing methods by a large margin. RTSMS is a joint work with Behnam Hashemi (Leicester).
Series This talk is part of the Applied and Computational Analysis series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- Applied and Computational Analysis
- bld31
- Centre for Mathematical Sciences, MR14
- CMS Events
- DAMTP info aggregator
- Featured lists
- Interested Talks
- My seminars
- Type the title of a new list here
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Yuji Nakatsukasa (University of Oxford) 
Thursday 12 October 2023, 15:00-16:00