Abstract | ||
---|---|---|
In this letter, we first present a rank-revealing matrix factorization algorithm by using randomization called randomized truncated pivoted QLP (RTp-QLP) to approximate an input matrix. For a dense and large n1 × n2 matrix with numerical rank k, RTp-QLP needs only a few passes over the matrix (regardless of k) and O(n1n2d) floating-point operations, where d is much smaller than both n1 and n2. Nex... |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/LSP.2019.2920054 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Matrix decomposition,Sparse matrices,Signal processing algorithms,Approximation algorithms,Principal component analysis,Estimation,Task analysis | Approximation algorithm,Combinatorics,Mathematical optimization,Matrix (mathematics),Matrix decomposition,Robust principal component analysis,Low-rank approximation,Factorization,Sparse matrix,Principal component analysis,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 7 | 1070-9908 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Maboud F. Kaloorazi | 1 | 1 | 4.75 |
Jie Chen | 2 | 7 | 5.50 |