Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition

DOI10.1109/TSP.2020.3001399MaRDI QIDQ5102900zbMATH 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://doi.org/10.1109/tsp.2020.3001399

Mathematics Subject Classification ID

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

Cited in

(6)

• Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization
• Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• An efficient randomized QLP algorithm for approximating the singular value decomposition
• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
• A novel adaptive low-rank matrix approximation method for image compression and reconstruction

This page was built for publication: Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition

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