Fast randomized numerical rank estimation for numerically low-rank matrices
Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an ad-hoc fashion in large-scale settings. In this work we devel...
Main Authors: | Meier, M, Nakatsukasa, Y |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2024
|
Similar Items
-
Randomized low-rank approximation for symmetric indefinite matrice
by: Taejun, P, et al.
Published: (2023) -
Index rank-$k$ numerical range of matrices
by: Sharifeh Rezagholi, et al.
Published: (2023-11-01) -
Finding a low-rank basis in a matrix subspace
by: Nakatsukasa, Y, et al.
Published: (2016) -
Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
by: Batselier, Kim, et al.
Published: (2019) -
Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition
by: Maboud F. Kaloorazi, et al.
Published: (2023-01-01)