Sketching for a low-rank nonnegative matrix approximation: numerical study
From MaRDI portal
Publication:6038456
DOI10.1515/rnam-2023-0009arXiv2201.11154OpenAlexW4364369041MaRDI QIDQ6038456
Stanislav S. Budzinskiy, Sergey A. Matveev
Publication date: 2 May 2023
Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11154
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20) Numerical analysis (65-XX)
Related Items
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Nonnegative low rank matrix approximation for nonnegative matrices
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Tensor train versus Monte Carlo for the multicomponent Smoluchowski coagulation equation
- A parallel low-rank solver for the six-dimensional Vlasov-Maxwell equations
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Exact solution of Smoluchowski's continuous multi-component equation with an additive kernel
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- A Note on the Generation of Random Normal Deviates
- Nonnegative Tensor Train Factorizations and Some Applications
- On the Complexity of Nonnegative Matrix Factorization
- Mersenne twister
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Tensor Decomposition Methods for High-dimensional Hamilton--Jacobi--Bellman Equations
- Randomized numerical linear algebra: Foundations and algorithms
