Modifying the singular value decompositions on the connection machine

Conference · Fri Dec 01 00:00:00 EST 1995

OSTI ID:125463

Yoon, P A; Barlow, J L ^[1]

---

1. 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; TRN: 95:005768-0007
• Resource Relation: Conference: 7. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, San Francisco, CA (United States), 15-17 Feb 1995; Other Information: PBD: 1995; Related Information: Is Part Of Proceedings of the seventh SIAM conference on parallel processing for scientific computing; Bailey, D.H.; Bjorstad, P.E.; Gilbert, J.R. [eds.] [and others]; PB: 894 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
PARALLEL PROCESSING
ALGORITHMS
COST BENEFIT ANALYSIS
EFFICIENCY
MATRICES
NUMERICAL SOLUTION