A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization (Q836790): Difference between revisions
From MaRDI portal
Changed an Item |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreicr5fuiqvta27q4zk4sxawkjny4yuwmoavp3u4ahref2b42vljl2q / rank | |||
Normal rank | |||
Latest revision as of 11:24, 22 February 2025
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
