DocumentCode
868981
Title
Computing the singular value decomposition on the Connection Machine
Author
Ewerbring, L. Magnus ; Luk, Franklin T.
Author_Institution
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
Volume
39
Issue
1
fYear
1990
fDate
1/1/1990 12:00:00 AM
Firstpage
152
Lastpage
155
Abstract
Consideration is given to the computation of the singular value decomposition (SVD) on the Connection Machine (CM). Brief descriptions of the Lisp language and some typical matrix manipulating functions are given. Implementation details of various Jacobi-SVD algorithms on an 8192-processor CM are presented. For n ×n matrices, where n ⩽64, the decomposition is computed in time O (n ) per sweep
Keywords
mathematics computing; matrix algebra; Connection Machine; Jacobi-SVD algorithms; computation; matrix manipulating functions; singular value decomposition; Computational modeling; Concurrent computing; Decoding; Digital audio players; Jacobian matrices; Matrix decomposition; Parallel machines; Parallel processing; Singular value decomposition; Switches;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.46294
Filename
46294
Link To Document