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á bibliografie

Vydáno v:	Algorithmica Ročník 72; číslo 1; s. 264 - 281
Hlavní autoři:	Witten, Rafi, Candès, Emmanuel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.05.2015
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!