Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions (Q93618): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Merged Item from Q3115854 |
Created claim: Wikidata QID (P12): Q46236603, #quickstatements; #temporary_batch_1726354825270 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q46236603 / rank | |||
Normal rank | |||
Latest revision as of 00:01, 15 September 2024
scientific article; zbMATH DE number 6005534
- Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions |
scientific article; zbMATH DE number 6005534 |
|
Statements
22 September 2009
0 references
11 February 2012
0 references
math.NA
0 references
math.PR
0 references
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions (English)
0 references
dimension reduction
0 references
eigenvalue decomposition
0 references
interpolative decomposition
0 references
Johnson-lindenstrauss lemma
0 references
matrix approximation
0 references
parallel algorithm
0 references
pass-efficient algorithm
0 references
principal component analysis
0 references
randomized algorithm
0 references
random matrix
0 references
rank-revealing QR factorization
0 references
singular value decomposition
0 references
streaming algorithm
0 references
numerical examples
0 references
data analysis
0 references
scientific computing
0 references
sparse input matrix
0 references
Krylov subspace methods
0 references
