A Generalized Randomized Rank-Revealing Factorization

We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a communication-optimal spectral divide-and-conquer algorithm for the nonsymmetric eigenvalue problem. In this paper, we establish that this randomized QR-factorization satisfies the strong rank-revealing properties. We also formally prove its stability, making it suitable in applications. Finally, we present numerical experiments which demonstrate that our theoretical bounds capture the empirical behavior of the factorization.

[1]  G. Golub,et al.  Linear least squares solutions by householder transformations , 1965 .

[2]  Peter Deuflhard,et al.  Numerische Mathematik. I , 2002 .

[3]  C. Bischof.  Incremental condition estimation , 1990 .

[4]  Per Christian Hansen,et al.  Some Applications of the Rank Revealing QR Factorization , 1992, SIAM J. Sci. Comput..

[5]  P. Tang,et al.  Bounds on Singular Values Revealed by QR Factorizations , 1999 .

[6]  Ioana Dumitriu.  Smallest eigenvalue distributions for two classes of $\beta$-Jacobi ensembles , 2010 .

[7]  James Demmel,et al.  Fast linear algebra is stable , 2006, Numerische Mathematik.

[8]  G. Stewart.  On graded QR decompositions of products of matrices , 1994 .

[9]  Rodrigo C. de Lamare,et al.  Adaptive reduced-rank processing based on joint and iterative interpolation, decimation, and filtering , 2009, IEEE Trans. Signal Process..

[10]  James Demmel,et al.  A 3D Parallel Algorithm for QR Decomposition , 2018, SPAA.

[11]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[12]  T. Chan.  Rank Revealing OR Factorizations * , 2001 .

[13]  James Demmel,et al.  Communication-optimal Parallel and Sequential QR and LU Factorizations , 2008, SIAM J. Sci. Comput..

[14]  Ivan Markovsky,et al.  Recent progress on variable projection methods for structured low-rank approximation , 2014, Signal Process..

[15]  Jed A. Duersch,et al.  Randomized QR with Column Pivoting , 2015, SIAM J. Sci. Comput..

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  Ming Gu,et al.  Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..

[18]  James Demmel,et al.  Reconstructing Householder Vectors from Tall-Skinny QR , 2014, IPDPS.

[19]  Robert A. van de Geijn,et al.  Householder QR Factorization With Randomization for Column Pivoting (HQRRP) , 2015, SIAM J. Sci. Comput..

[20]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.