Pages that link to "Item:Q4575598"
From MaRDI portal
The following pages link to Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities (Q4575598):
Displaying 19 items.
- (Q4558543) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- (Q4637040) (← links)
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Optimal and algorithmic norm regularization of random matrices (Q5096658) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- (Q5875521) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices (Q6094751) (← links)
- Fast randomized numerical rank estimation for numerically low-rank matrices (Q6154411) (← links)
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems (Q6561643) (← links)
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores (Q6599985) (← links)
- Broadband recursive skeletonization (Q6620214) (← links)
- Fast and forward stable randomized algorithms for linear least-squares problems (Q6623665) (← links)
