The following pages link to (Q3002774):
Displaying 19 items.
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm (Q721819) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- Linear-time CUR approximation of BEM matrices (Q2292005) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem (Q2679692) (← links)
- LEAST SQUARES APPROXIMATIONS OF MEASURES VIA GEOMETRIC CONDITION NUMBERS (Q3115487) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- (Q4558476) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
- (Q5002622) (← links)
- A Local Search Framework for Experimental Design (Q5092507) (← links)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection (Q5146626) (← links)
- Optimal Column-Based Low-Rank Matrix Reconstruction (Q5743470) (← 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)
- Randomized Quasi-Optimal Local Approximation Spaces in Time (Q6097875) (← links)
- Lower bounds for column matrix approximations (Q6148034) (← links)
