Efficient Algorithms for CUR and Interpolative Matrix Decompositions
  The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. The methods used are based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for implementation. For certain applications, further acceleration can be attained by incorporating techniques based on randomized projections. Numerical experiments demonstrate advantageous performance compared to existing techniques for computing CUR factorizations. 
Sergey Voronin and Per-Gunnar Martinsson
math.NA cs.NA