Effective implementation to reduce execution time of a low-rank matrix approximation problem
From MaRDI portal
Publication:2231284
DOI10.1016/j.cam.2021.113763zbMath1490.65082OpenAlexW3193535330MaRDI QIDQ2231284
Jeffry Chavarría-Molina, Pablo Soto-Quiros, Juan José Fallas-Monge
Publication date: 29 September 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113763
Theory of matrix inversion and generalized inverses (15A09) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fast density-weighted low-rank approximation spectral clustering
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
- Networks and the best approximation property
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- Rank constrained matrix best approximation problem
- Towards theory of generic principal component analysis
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
- A general class of arbitrary order iterative methods for computing generalized inverses
- Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm
- Fast low-rank modifications of the thin singular value decomposition
- Optimal regularized low rank inverse approximation
- Application of the pseudoinverse computation in reconstruction of blurred images
- An efficient approach for computing optimal low-rank regularized inverse matrices
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- Fast computing of the Moore-Penrose inverse matrix
- On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXAH=B
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- A fast and efficient algorithm for low-rank approximation of a matrix
- Fast computation of low rank matrix approximations
- Optimal Regularized Inverse Matrices for Inverse Problems
- Generalized Rank-Constrained Matrix Approximations
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
