A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures SIAM Journal on Scientific Computing Volume 20, Number 6 pp. A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures Fran oise Tisseur, Jack Dongarra Abstract. We present a new parallel implementation of a divide and conquer algorithm for computing the spectral decomposition of a symmetric tridiagonal matrix on distributed memory architectures. This algorithm yields the first scalable, portable, and numerically stable parallel divide and conquer eigensolver.
Numerical results confirm the effectiveness of our algorithm.
We compare performance of the algorithm with that of the QR algorithm and of bisection followed by inverse iteration on an IBM SP2 and a cluster of Pentium PIIs. 68C25 PII .