Date
Tue, 24 Apr 2018
Time
14:30 - 15:00
Location
L3
Speaker
Abinand Gopal
Organisation
Oxford

Over the past decade, the randomized singular value decomposition (RSVD) algorithm has proven to be an efficient, reliable alternative to classical algorithms for computing low-rank approximations in a number of applications. However, in cases where no information is available on the singular value decay of the data matrix or the data matrix is known to be close to full-rank, the RSVD is ineffective. In recent years, there has been great interest in randomized algorithms for computing full factorizations that excel in this regime.  In this talk, we will give a brief overview of some key ideas in randomized numerical linear algebra and introduce a new randomized algorithm for computing a full, rank-revealing URV factorization.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 14:57.