Randomized Low-Rank Approximation for Symmetric Indefinite Matrices

The Nyström method is a popular choice for finding a low-rank approximation to a symmetric positive semidefinite 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 Nyström approximation to symmetric indefinite matrices. We then prove the existence of a variant that overcomes the instability, and establish relative-error nuclear norm bounds of the resulting approximation that hold when the singular values decay rapidly. The analysis naturally leads to a practical algorithm, whose robustness is illustrated with experiments.