Abstract
We propose the pass-efficient truncated UTV algorithm, a faster variant of the TUXV algorithm for low-rank approximations. Compared with the TUXV algorithm, data transfer and the complexity of the proposed algorithm are reduced. Therefore, our algorithm is suitable for large matrices stored out of memory or generated by streaming data. We also develop residual error upper bounds and singular value approximation error bounds for the pass-efficient truncated UTV algorithm. Numerical experiments are reported to demonstrate the efficiency and effectiveness of our algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Data available within the article or its supplementary materials.
References
Alter O, Brown PO, Botstein D (2000) Singular value decomposition for genome-wide expression data processing and modeling. Proc Natl Acad Sci 97(18):10101–10106
Anderson E, Bai Z, Bischof C, Blackford LS, Demmel J, Dongarra J, Du Croz J, Greenbaum A, Hammarling S, McKenney A (1999) LAPACK users’ guide. SIAM, Philadelphia
Bischof C, Van Loan C (1987) The WY representation for products of householder matrices. SIAM J Sci Stat Comput 8(1):2–13
Bjarkason EK (2019) Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views. SIAM J Sci Comput 41(4):2355–2383
Chandrasekaran S, Ipsen IC (1994) On rank-revealing factorisations. SIAM J Matrix Anal Appl 15(2):592–622
Drineas P, Mahoney MW (2018) Lectures on randomized numerical linear algebra. Math Data 25:1
Duersch JA, Gu M (2017) Randomized QR with column pivoting. SIAM J Sci Comput 39(4):263–291
Eckart C, Young G (1936) The approximation of one matrix by another of lower rank. Psychometrika 1(3):211–218
Eldar YC, Kutyniok G (2012) Compressed sensing: theory and applications. Cambridge University Press, New York
Eldén L (2007) Matrix methods in data mining and pattern recognition. SIAM, Philadelphia
Feng Y, Xiao J, Gu M (2019) Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition. Electron Trans Numer Anal 51:469–494
Feng X, Yu W, Xie Y (2023) Pass-efficient randomized SVD with boosted accuracy. In: Machine learning and knowledge discovery in databases: European conference, ECML PKDD 2022, Grenoble, France, September 19–23, 2022, Proceedings, Part I, Springer, pp 3–20
Golub GH, Van Loan CF (2013) Matrix computations. JHU Press, Baltimore
Gu M (2015) Subspace iteration randomization and singular value problems. SIAM J Sci Comput 37(3):1139–1173
Halko N, Martinsson P-G, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217–288
Horn RA, Johnson CR (1994) Topics in matrix analysis. Cambridge University Press, New York
Huckaby DA, Chan TF (2003) On the convergence of Stewart’s QLP algorithm for approximating the SVD. Numer Algorithms 32(2):287–316
Kaloorazi MF, Chen J (2021) Projection-based QLP algorithm for efficiently computing low-rank approximation of matrices. IEEE Trans Signal Process 69:2218–2232
Kaloorazi MF, Lamare RC (2018) Subspace-orbit randomized decomposition for low-rank matrix approximations. IEEE Trans Signal Process 66(16):4409–4424
LeCun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proc IEEE 86(11):2278–2324
Li H, Yin S (2020) Single-pass randomized algorithms for LU decomposition. Linear Algebra Appl 595:101–122
Martinsson P-G, Tropp JA (2020) Randomized numerical linear algebra: Foundations and algorithms. Acta Numer 29:403–572
Murray R, Demmel J, Mahoney MW, Erichson NB, Melnichenko M, Malik OA, Grigori L, Luszczek P, Dereziński M, Lopes ME et al (2023) Randomized numerical linear algebra: a perspective on the field with an eye to software. arXiv preprint arXiv:2302.11474
Ren H, Xiao G, Bai Z-J (2022) Single-pass randomized QLP decomposition for low-rank approximation. Calcolo 59(4):1–28
Shabat G, Shmueli Y, Aizenbud Y, Averbuch A (2018) Randomized LU decomposition. Appl Comput Harmon Anal 44(2):246–272
Stewart G (1999) The QLP approximation to the singular value decomposition. SIAM J Sci Comput 20(4):1336–1348
Tropp JA, Yurtsever A, Udell M, Cevher V (2017) Practical sketching algorithms for low-rank matrix approximation. SIAM J Matrix Anal Appl 38(4):1454–1485
Tropp JA, Yurtsever A, Udell M, Cevher V (2019) Streaming low-rank matrix approximation with an application to scientific simulation. SIAM J Sci Comput 41(4):2430–2463
Woodruff DP (2014) Sketching as a tool for numerical linear algebra. Found Trends Theor Comput Sci 10:1–157
Wu N, Xiang H (2020) Randomized QLP decomposition. Linear Algebra Appl 599:18–35
Xiao J, Gu M, Langou J (2017) Fast parallel randomized QR with column pivoting algorithms for reliable low-rank matrix approximations. In: 2017 IEEE 24th international conference on high performance computing (HiPC). IEEE, pp 233–242
Acknowledgements
The authors are grateful to the anonymous referees for their valuable comments and suggestions which improved the quality of this paper. This work was supported by National Natural Science Foundation of China (Grant No. 12001363).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
No potential conflict of interest was reported by the authors.
Additional information
Communicated by Jinyun Yuan.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ji, Y., Feng, Y. & Dong, Y. Pass-efficient truncated UTV for low-rank approximations. Comp. Appl. Math. 43, 65 (2024). https://doi.org/10.1007/s40314-023-02584-4
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-023-02584-4