Pages that link to "Item:Q3624872"
From MaRDI portal
The following pages link to Relative-Error $CUR$ Matrix Decompositions (Q3624872):
Displaying 31 items.
- System Identification via CUR-Factored Hankel Approximation (Q4610144) (← links)
- (Q4633019) (← links)
- (Q4633051) (← links)
- (Q4633059) (← links)
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models (Q4637075) (← links)
- (Q5005143) (← links)
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning (Q5006445) (← links)
- CUR LRA at Sublinear Cost Based on Volume Maximization (Q5014668) (← links)
- A Distance-Preserving Matrix Sketch (Q5057218) (← links)
- A Generalized CUR Decomposition for Matrix Pairs (Q5070854) (← links)
- Tensor CUR Decomposition under T-Product and Its Perturbation (Q5080258) (← links)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection (Q5146626) (← links)
- (Q5149239) (← links)
- (Q5159482) (← links)
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data (Q5236621) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Conditioning of Leverage Scores and Computation by QR Decomposition (Q5502147) (← links)
- Perturbations of CUR Decompositions (Q5857848) (← links)
- Robust CUR Decomposition: Theory and Imaging Applications (Q5860372) (← links)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- A hybrid stochastic interpolation and compression method for kernel matrices (Q6087910) (← links)
- Randomized Quasi-Optimal Local Approximation Spaces in Time (Q6097875) (← links)
- A Model-free Variable Screening Method Based on Leverage Score (Q6107196) (← links)
- Admissible subspaces and the subspace iteration method (Q6149879) (← links)
- Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction (Q6161026) (← links)
- Link Prediction for Egocentrically Sampled Networks (Q6181401) (← links)