Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations

DOI10.1109/TSP.2018.2853137zbMath1414.68143arXiv1804.00462WikidataQ129554107 ScholiaQ129554107MaRDI QIDQ4622339

Maboud Farzaneh Kaloorazi, Rodrigo C. de Lamare

Publication date: 12 February 2019

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

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

Mathematics Subject Classification ID

Factorization of matrices (15A23) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

An efficient algorithm for computing the approximate t-URV and its applications ⋮ An efficient randomized QLP algorithm for approximating the singular value decomposition ⋮ Pass-efficient truncated UTV for low-rank approximations ⋮ Background subtraction using adaptive singular value decomposition ⋮ Single-pass randomized algorithms for LU decomposition ⋮ Single-pass randomized QLP decomposition for low-rank approximation

This page was built for publication: Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations