A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures

The response of an airplane to air turbulence  and the response
of a  power system network to a fault in the network are two examples
of important types of analyses which require large scale  eigenvalue
and eigenvector computations. In this paper we present message passing
parallel algorithms for computing eigenvalues of very large real symmetric
matrices which are based upon a simple real symmetric Lanczos recursion.


KEYWORDS: parallel algorithms, eigenvalues, Lanczos recursion, large matrices, message passing.

By: Jane Cullum and Susanne M. Balle

Published in: Applied Numerical Mathematics, volume 30, (no 1-2), pages 341-65 in 1999

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .