Computing the singular value decomposition on a distributed system of vector processors (Q1122941): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587874 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042123940 / rank | |||
Normal rank | |||
Latest revision as of 19:13, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the singular value decomposition on a distributed system of vector processors |
scientific article |
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
