By Topic

Computing the singular value decomposition on the Connection Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ewerbring, L.M. ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Luk, F.T.

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

Published in:

Computers, IEEE Transactions on  (Volume:39 ,  Issue: 1 )