Fast algorithms for volume-based CUR low-rank approximation and their application to nonnegative matrix approximation and matrix completion problems.
-
Updated
Jul 24, 2024 - Fortran
Fast algorithms for volume-based CUR low-rank approximation and their application to nonnegative matrix approximation and matrix completion problems.
Add a description, image, and links to the low-rank topic page so that developers can more easily learn about it.
To associate your repository with the low-rank topic, visit your repo's landing page and select "manage topics."