Effective implementation to reduce execution time of a low-rank matrix approximation problem
From MaRDI portal
Recommendations
- Generalized low rank approximations of matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized low rank approximations of matrices
- Fast low rank approximations of matrices and tensors
- A fast and efficient algorithm for low-rank approximation of a matrix
Cites work
- scientific article; zbMATH DE number 3945129 (Why is no real title available?)
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- A fast and efficient algorithm for low-rank approximation of a matrix
- A general class of arbitrary order iterative methods for computing generalized inverses
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- An efficient approach for computing optimal low-rank regularized inverse matrices
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Application of the pseudoinverse computation in reconstruction of blurred images
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast computation of low rank matrix approximations
- Fast computing of the Moore-Penrose inverse matrix
- Fast density-weighted low-rank approximation spectral clustering
- Fast low-rank modifications of the thin singular value decomposition
- Fast monte-carlo algorithms for finding low-rank approximations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized Rank-Constrained Matrix Approximations
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
- Introduction to algorithms.
- Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm
- Matrix mathematics. Theory, facts, and formulas
- Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
- Networks and the best approximation property
- On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXAH=B
- Optimal regularized inverse matrices for inverse problems
- Optimal regularized low rank inverse approximation
- Rank constrained matrix best approximation problem
- Regularization algorithms for learning that are equivalent to multilayer networks
- Towards theory of generic principal component analysis
Cited in
(5)- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- Generalized low rank approximations of matrices
- Fast random vector transforms in terms of pseudo-inverse within the Wiener filtering paradigm
- Efficient implementation of minimal polynomial and reduced rank extrapolation methods
- Davis-Kahan theorem under a moderate gap condition
This page was built for publication: Effective implementation to reduce execution time of a low-rank matrix approximation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231284)
