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

Given a matrix <inline-formula><tex-math notation="LaTeX">\bf A</tex-math></inline-formula> with numerical rank <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>, the two-sided orthogonal decomposition (TSOD)...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on signal processing Ročník 68; s. 3575 - 3589
Hlavní autori:	Kaloorazi, Maboud F., Chen, Jie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Acoustics Algorithms Approximation Approximation algorithms Decomposition dimension reduction image recovery low-rank approximation Machine learning algorithms Mathematical analysis Matrix decomposition Randomization randomized numerical linear algebra rank-revealing factorization Signal processing algorithms Sparse matrices Subspaces Surges Upper bounds
ISSN:	1053-587X, 1941-0476
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!