Share Email Print

Proceedings Paper

The Parallel Solution Of Eigenproblems On Multiprocessor Systems
Author(s): P. .J. Eberlein
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We describe here 'one-sided' Jacobi methods for solving eigenproblems on parallel architectures. These methods are modifications of the procedure introduced by Hestenesl, which uses only columns of the matrix. Thus, only 'local' information is needed in each processor. The Jacobi angle is determined from columns of the factored matrix and columns of the matrix which ultimately becomes the eigenvector matrix. The singular value decomposition may be considered as a special case. The eigenvalue decompositions for symmetric, real normal, and, orthogonal matrices may be regarded as generalizations. Extensions to the complex field are easily derived. We also describe a new formation of Jacobi rotation sets. These require only one send and one receive per set, and a complete set is found in the minimal n-1 steps. We use the ordering of the diagonal elements of the matrix so that, in general, one may obtain only a few of the eigenvalues (and vectors) as required. Implementations of these algorithms may be made on various kinds of parallel architectures, including the hypercube.

Paper Details

Date Published: 21 January 1988
PDF: 6 pages
Proc. SPIE 0826, Advanced Algorithms and Architectures for Signal Processing II, (21 January 1988); doi: 10.1117/12.942027
Show Author Affiliations
P. .J. Eberlein, University at Buffalo (United States)

Published in SPIE Proceedings Vol. 0826:
Advanced Algorithms and Architectures for Signal Processing II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top