A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization (Q836790)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5602107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization |
scientific article; zbMATH DE number 5602107 |
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
0.8244903087615967
0 references
0.8229334950447083
0 references
0.8164743185043335
0 references
