Efficient one-sided Jacobi algorithms for singular value decomposition
and the symmetric eigenproblem
155. B. B. Zhou,
R. P. Brent and M. H. Kahn,
Efficient one-sided Jacobi algorithms for singular value decomposition
and the symmetric eigenproblem,
Proc. IEEE First International Conference on Algorithms and
Architectures for Parallel Processing (ICA3PP),
IEEE Press, 1995, 256-262.
Preliminary version:
B. B. Zhou, R. P. Brent and M. H. Kahn,
"A one-sided Jacobi algorithm for
the symmetric eigenvalue problem",
Proc. Third Parallel Computing Workshop (PCW'94)
Fujitsu Laboratories, Kawasaki, Japan, November 1994, P1-Q-1--P1-Q-7.
Paper (preliminary version):
dvi (22K),
pdf (89K),
ps (69K).
Abstract
A method which uses one-sided Jacobi to solve the symmetric
eigenvalue problem in parallel is presented. We describe a parallel
ring ordering for one-sided Jacobi computation.
One distinctive feature of this ordering is that
it can sort column norms in each sweep, which is very important to achieve
fast convergence.
Experimental results on both the Fujitsu AP1000
and the Fujitsu VPP500 are reported.
Go to next publication
Return to Richard Brent's index page