Randomized low-rank approximation for symmetric indefinite matrice
The Nystr¨om method is a popular choice for finding a low-rank approximation to a symmetric positive semi-definite matrix. The method can fail when applied to symmetric indefinite matrices, for which the error can be unboundedly large. In this work, we first identify the main challenges in finding a...
Main Authors: | Taejun, P, Nakatsukasa, YN |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics
2023
|
Similar Items
-
Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, M, et al.
Published: (2024) -
Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, T, et al.
Published: (2025) -
Condition numbers of indefinite rank 2 ghost Wishart matrices
by: Movassagh, Ramis, et al.
Published: (2017) -
Matrices and indefinite scalar products /
by: Gohberg, I., 1928-, et al.
Published: (1983) -
Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
by: Batselier, Kim, et al.
Published: (2019)