On the optimality of Voronoi-based column selection
From MaRDI portal
Cites work
- A DEIM induced CUR factorization
- A theory of pseudoskeleton approximations
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- An improved approximation algorithm for the column subset selection problem
- Centroidal Voronoi Tessellation-Based Reduced-Order Modeling of Complex Systems
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Column subset selection is NP-complete
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- CUR matrix decompositions for improved data analysis
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient algorithms for CUR and interpolative matrix decompositions
- scientific article; zbMATH DE number 1197366 (Why is no real title available?)
- scientific article; zbMATH DE number 2065597 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Missing Point Estimation in Models Described by Proper Orthogonal Decomposition
- Non-linear generalization of principal component analysis: from a global to a local approach
- Nonlinear model order reduction via dynamic mode decomposition
- Nonlinear model reduction via discrete empirical interpolation
- Numerical linear algebra. Twenty-fifth anniversary edition
- Relative-Error CUR Matrix Decompositions
- Sampling algorithms for l₂ regression and applications
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
This page was built for publication: On the optimality of Voronoi-based column selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012214)
