Pages that link to "Item:Q5251753"
From MaRDI portal
The following pages link to Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753):
Displaying 12 items.
- Algorithms that satisfy a stopping criterion, probably (Q269806) (← links)
- Sub-sampled Newton methods (Q1739039) (← links)
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
- Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
- Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- A Probabilistic Subspace Bound with Application to Active Subspaces (Q4584918) (← links)
- Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning (Q4969047) (← links)
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems (Q4997391) (← links)
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction (Q5112642) (← links)
- A Multilevel Monte Carlo Estimator for Matrix Multiplication (Q5131979) (← links)
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems (Q5161747) (← links)