Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
From MaRDI portal
Cites work
- A DEIM induced CUR factorization
- A Multilinear Singular Value Decomposition
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- A new truncation strategy for the higher-order singular value decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
- An Extension of Chebfun to Two Dimensions
- An improved approximation algorithm for the column subset selection problem
- Approximation of boundary element matrices
- Cauchy-Binet for pseudo-determinants
- Computing characteristic polynomials from eigenvalues
- Core-Chasing Algorithms for the Eigenvalue Problem
- Deterministic Feature Selection for K-Means Clustering
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast monte-carlo algorithms for finding low-rank approximations
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- LAPACK Users' Guide
- Matrix approximation and projective clustering via volume sampling
- Nonlinear model reduction via discrete empirical interpolation
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- On Rank-Revealing Factorisations
- On selecting a maximum volume sub-matrix of a matrix and related problems
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- On the low-rank approximation by the pivoted Cholesky decomposition
- Rang revealing QR factorizations
- Regularized greedy column subset selection
- Relative-Error CUR Matrix Decompositions
- Sensor Selection via Convex Optimization
- Sketching as a tool for numerical linear algebra
- Tensor Decompositions and Applications
- The maximal-volume concept in approximation by low-rank matrices
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
Cited in
(20)- On the accuracy of cross and column low-rank maxvol approximations in average
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Functional Tucker approximation using Chebyshev interpolation
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Low-rank approximation in the Frobenius norm by column and row subset selection
- Approximation in the extended functional tensor train format
- An L-DEIM induced high order tensor interpolatory decomposition
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- On the approximation of vector-valued functions by volume sampling
- Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
- Estimating a matrix's singular values with interpolative decompositions
- A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
- Close to optimal column approximation using a single SVD
- Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Accuracy and stability of CUR decompositions with oversampling
- A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations
- Algorithm-agnostic low-rank approximation of operator monotone matrix functions
This page was built for publication: Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146626)
