Computing the singular value decomposition on a distributed system of vector processors (Q1122941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1122941 |
scientific article; zbMATH DE number 4108019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the singular value decomposition on a distributed system of vector processors |
scientific article; zbMATH DE number 4108019 |
Statements
Computing the singular value decomposition on a distributed system of vector processors (English)
0 references
1989
0 references
The two-sided Jacobi algorithm of \textit{G. E. Forsythe} and \textit{P. Henrici} [Trans. Am. Math. Soc. 94, 1-23 (1960; Zbl 0092.325)] is implemented on a LCAP system consisting of a ring of vector processors. Two block versions are compared on a series of random test matrices, and it is demonstrated that the computation is nearly perfectly sped up turning the speed of the subproblem solver into the decisive factor.
0 references
singular value decomposition
0 references
two-sided Jacobi algorithm
0 references
vector processors
0 references
0.8764727115631104
0 references
0.8613801002502441
0 references
0.8490365147590637
0 references
