Near-optimal column-based matrix reconstruction
From MaRDI portal
Recommendations
- Optimal column-based low-rank matrix reconstruction
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
- An improved approximation algorithm for the column subset selection problem
- Local reconstruction of low-rank matrices and subspaces
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Cited in
(38)- Fast randomized matrix and tensor interpolative decomposition using countsketch
- New applications of matrix methods
- Low-rank approximation algorithms for matrix completion with random sampling
- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
- A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds
- Regularized greedy column subset selection
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
- Optimal Quadrature-Sparsification for Integral Operator Approximation
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Local reconstruction of low-rank matrices and subspaces
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Greedy minimization of weakly supermodular set functions
- Low rank approximation of binary matrices: column subset selection and generalizations
- Singular values of dual quaternion matrices and their low-rank approximations
- Allocation Strategies for High Fidelity Models in the Multifidelity Regime
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Optimal column-based low-rank matrix reconstruction
- Robust CUR Decomposition: Theory and Imaging Applications
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Stochastic linear regularization methods: random discrepancy principle and applications
- Lower bounds for column matrix approximations
- Admissible subspaces and the subspace iteration method
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- A statistical view of column subset selection
- A hybrid algorithm for computing a partial singular value decomposition satisfying a given threshold
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Accuracy and stability of CUR decompositions with oversampling
- Dominant subspace and low-rank approximations from block Krylov subspaces without a prescribed gap
- Proximal algorithms and temporal difference methods for solving fixed point problems
- Leverage score-based quaternion CUR decomposition: gap error analysis and applications
- Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
- Interlacing polynomial method for matrix approximation via generalized column and row selection
- Approximation of functions: optimal sampling and complexity
- Subset selection for matrices in spectral norm
- On the adaptively inexact sketched Newton-Raphson methods for nonlinear systems of equations
- Guessing efficiently for constrained subspace approximation
- Error Analysis and Precision Selection for Mixed-Precision DEIM-CUR Decompositions
This page was built for publication: Near-optimal column-based matrix reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494935)
