An efficient randomized QLP algorithm for approximating the singular value decomposition

Abstract

The rank-revealing pivoted QLP decomposition approximates the computationally prohibitive singular value decomposition (SVD) via two consecutive column-pivoted QR (CPQR) decomposition. It furnishes information on all four fundamental subspaces of the matrix. In this paper, we introduce a randomized version of the QLP decomposition called Rand-QLP. Operating on a matrix A, Rand-QLP gives A=QLPT, where Q and P are orthonormal, and L is lower-triangular. Under the assumption that the rank of the input matrix is k, we derive several error bounds for Rand-QLP: bounds for the first k approximate singular values and for the trailing block of the middle factor L, which show that the decomposition is rank-revealing; bounds for the distance between approximate subspaces and the exact ones for all four fundamental subspaces of a given matrix; and bounds for the errors of low-rank approximations constructed by the columns of Q and P. Rand-QLP is able to effectively leverage modern computational architectures, due to the utilization of random sampling and the unpivoted QR decomposition, thus addressing a serious bottleneck associated with classical algorithms such as the SVD, CPQR and most recent matrix decomposition algorithms. We utilize a modern computing architecture to assess the performance behavior of different algorithms. In comparison to CPQR and the SVD, Rand-QLP respectively achieves a speedup of up to 5 times and 6.6 times on the CPU and up to 3.8 times and 4.4 times with the hybrid GPU architecture. In terms of quality of approximation, our results on synthetic and real data show that the approximations by Rand-QLP are comparable to those of pivoted QLP and the optimal SVD, and in most cases are considerably better than those of CPQR.