By Topic

On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions

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
$33 $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)
B. B. Zhou ; Comput. Sci. Lab., Australian Nat. Univ., Canberra, ACT, Australia ; R. P. Brent

In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. Two parallel Jacobi orderings are described. These orderings can generate n(n-1)/2 different index pairs and sort column norms at the same time. The one-sided Jacobi SVD algorithm using these parallel orderings converges in about the same number of sweeps as the sequential cyclic Jacobi algorithm. Some experimental results on a Fujitsu AP1000 are presented. The issue of equivalence of orderings is also discussed

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Euromicro Workshop on

Date of Conference:

25-27 Jan 1995