Modifying the singular value decompositions on the connection machine
Conference
·
OSTI ID:125463
- Pennsylvania State Univ., University Park, PA (United States)
A fully parallel algorithm for updating and downdating the singular value decompositions (SVD) of an m-by-n (m {>=} n) A is described. The algorithm involves similar chasing techniques for modifying the SVDs described in, but fewer plane rotations, and can be implemented almost identically for both updating and downdating. Both cyclic and consecutive storage schemes are considered in parallel implementation. We show that the latter scheme outperforms the former on a coarse-grain distributed-memory MIMD multiprocessor. We present the experimental results on the 32-node Connection Machine (CM-5).
- OSTI ID:
- 125463
- Report Number(s):
- CONF-950212--; CNN: Grant CCR-9201612
- Country of Publication:
- United States
- Language:
- English
Similar Records
Implementation of the singular-value decomposition on the Connection Machine CM-2
A multiprocessor scheme for the singular value decomposition
Algorithm for singular value decomposition
Technical Report
·
Thu Apr 11 00:00:00 EDT 1991
·
OSTI ID:5439679
A multiprocessor scheme for the singular value decomposition
Conference
·
Sat Aug 01 00:00:00 EDT 1987
·
OSTI ID:5576354
Algorithm for singular value decomposition
Conference
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:6652319