Randomized algorithms for low-rank matrix factorizations: sharp performance bounds (Q2345951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomized algorithms for low-rank matrix factorizations: sharp performance bounds |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized algorithms for low-rank matrix factorizations: sharp performance bounds |
scientific article |
Statements
Randomized algorithms for low-rank matrix factorizations: sharp performance bounds (English)
0 references
21 May 2015
0 references
randomized linear algebra
0 references
dimension reduction
0 references
pass efficient algorithm
0 references
matrix approximation
0 references
random matrix
0 references
0 references
0.8187822699546814
0 references
0.8091573715209961
0 references
0.8061421513557434
0 references
0.8050546646118164
0 references
0.8032749891281128
0 references
