Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
Matrix skeletonizations like the interpolative and CUR decompositions provide a framework for low-rank approximation in which subsets of a given matrix’s columns and/or rows are selected to form approximate spanning sets for its column and/or row space. Such decompositions that rely on “natural” bas...
Saved in:
Published in | Advances in computational mathematics Vol. 49; no. 4 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.08.2023
Springer Nature B.V Springer |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!