Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
From MaRDI portal
(Redirected from Publication:1806006)
Recommendations
Cited in
(40)- A Distance-Preserving Matrix Sketch
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- Generalizing the column-row matrix decomposition to multi-way arrays
- A randomized algorithm for the decomposition of matrices
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Column subset selection problem is UG-hard
- Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting
- A QR-method for computing the singular values via semiseparable matrices
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- A DEIM induced CUR factorization
- A generalized CUR decomposition for matrix pairs
- Perturbations of CUR Decompositions
- Perspectives on CUR decompositions
- Block discrete empirical interpolation methods
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part
- Randomized GCUR decompositions
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- A literature survey of matrix methods for data science
- Q-less QR decomposition in inner product spaces
- Subspaces analysis for random projection UTV framework
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Algorithm 844
- Algorithms for computing the QR decomposition of a set of matrices with common columns
- An extended DEIM algorithm for subset selection and class identification
- Literature survey on low rank approximation of matrices
- On the low-rank approximation by the pivoted Cholesky decomposition
- Random sampling and efficient algorithms for multiscale PDEs
- CUR matrix decompositions for improved data analysis
- Randomized QR with column pivoting
- Interpretation and solution of ill-conditioned equations arising in parameter estimation and system identification
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- Exemplar-based low-rank matrix decomposition for data clustering
- Randomized algorithms in numerical linear algebra
- Stewart's pivoted QLP decomposition for low‐rank matrices
This page was built for publication: Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806006)
