Efficient Parallel Nonnegative Least Squares on Multicore Architectures
From MaRDI portal
Recommendations
- Parallel Nonnegative Matrix Factorization via Newton Iteration
- A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
- scientific article; zbMATH DE number 3967813
- scientific article; zbMATH DE number 833698
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- scientific article; zbMATH DE number 4056886
- A parallel multisplitting solution of the least squares problem
- scientific article; zbMATH DE number 238288
- scientific article; zbMATH DE number 17455
- Parallel nonnegative matrix factorization algorithm on the distributed memory platform
Cited in
(7)- Non-negative moment fitting quadrature rules for fictitious domain methods
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- S-NNLS: An efficient non-negative least squares algorithm for sequential data
- Parallel Nonnegative Matrix Factorization via Newton Iteration
- GPU parameter tuning for tall and skinny dense linear least squares problems
- Exploiting multi-core architectures for reduced-variance estimation with intractable likelihoods
- Accelerating the Lawson-Hanson NNLS solver for large-scale Tchakaloff regression designs
This page was built for publication: Efficient Parallel Nonnegative Least Squares on Multicore Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116463)