Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds

The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed algorithms in the literature for dimensionality reduction—specific...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 72; číslo 1; s. 264 - 281
Hlavní autori:	Witten, Rafi, Candès, Emmanuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.05.2015
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Matrix approximation Dimension reduction Random matrix Randomized linear algebra Pass efficient algorithm
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!