A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization (Q836790): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: JDQR / rank | |||
Normal rank | |||
Revision as of 00:46, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization |
scientific article |
Statements
A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization (English)
0 references
8 September 2009
0 references
partial singular value decomposition
0 references
Lanczos bidiagonalization
0 references
thick restart
0 references
parallel computing
0 references
large sparse matrix
0 references
reorthogonalization
0 references
