Title :
SVD computation on the Connection Machine
Author :
Ewerbring, L. Magnus ; Luk, Franklin T. ; Ruttenberg, Alan H.
Author_Institution :
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
Abstract :
The computation of the singular-value decomposition of a matrix on the Connection Machine is presented. The machine architecture is described, and it is explained why a Jacobi-type approach makes very efficient use of the available massive parallelism. Different implementation strategies are discussed for the case in which the problem size exceeds the machine size and vice versa. Encouraging timing data showing linear-time behavior of the algorithm are presented.<>
Keywords :
computer architecture; Connection Machine; Jacobi-type approach; computation; linear-time behavior; massive parallelism; singular-value decomposition; timing data; Computer architecture; Concurrent computing; Hardware; Jacobian matrices; Lattices; Matrix decomposition; Parallel processing; Signal processing algorithms; Singular value decomposition; Timing;
Conference_Titel :
System Sciences, 1988. Vol.I. Architecture Track, Proceedings of the Twenty-First Annual Hawaii International Conference on
Conference_Location :
Kailua-Kona, HI, USA
Print_ISBN :
0-8186-0841-2
DOI :
10.1109/HICSS.1988.11758
