Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices

DOI10.1109/TSP.2021.3066258MaRDI QIDQ5103498zbMATH OpenOpenAlexFDO

Authors Maboud Farzaneh Kaloorazi, Jie Chen

Publication date 23 September 2022

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.07245

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(6)

• An efficient algorithm for computing the approximate t-URV and its applications
• Computing projections with LSQR
• Low-rank approximation: randomized QR with column pivoting and related methods using sparse projection and pass-efficient techniques
• A novel adaptive low-rank matrix approximation method for image compression and reconstruction
• An efficient randomized QLP algorithm for approximating the singular value decomposition
• Pass-efficient truncated UTV for low-rank approximations

This page was built for publication: Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5103498)