Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 971 / rank | |||
Normal rank | |||
Revision as of 10:09, 29 February 2024
scientific article; zbMATH DE number 7105501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views |
scientific article; zbMATH DE number 7105501 |
Statements
Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (English)
0 references
16 September 2019
0 references
singular value decomposition
0 references
random
0 references
low rank
0 references
subspace iteration
0 references
single pass
0 references
block Krylov
0 references
