Sublinear Randomized Algorithms for Skeleton Decompositions
A skeleton decomposition of a matrix A is any factorization of the form A[subscript :C]ZA[subscript R:], where A[subscript :C] comprises columns of A, and A[subscript R:] comprises rows of A. In this paper, we investigate the conditions under which random sampling of C and R results in accurate skel...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2014-01-13T14:56:07Z.
|
| Subjects: | |
| Online Access: | Get fulltext |