Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
From MaRDI portal
Publication:6094751
DOI10.1137/22m1538648zbMath1522.65068arXiv2212.01127OpenAlexW4386539915MaRDI QIDQ6094751
Yuji Nakatsukasa, Unnamed Author
Publication date: 14 September 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01127
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- A fast randomized algorithm for the approximation of matrices
- Generalized Wasserstein distance and its application to transport equations with source
- Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
- Computational Advertising: Techniques for Targeting Relevant Ads
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Algorithm 971
- Low-Rank Approximation and Regression in Input Sparsity Time
- Matrix Analysis
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Why Are Big Data Matrices Approximately Low Rank?
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Eigenvalues of a matrix in the streaming model
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized Nyström Preconditioning
This page was built for publication: Randomized Low-Rank Approximation for Symmetric Indefinite Matrices