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: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2014
|
| Online Access: | http://hdl.handle.net/1721.1/83890 https://orcid.org/0000-0001-7052-5097 |