A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
Jack J. Dongarra, Danny C. Sorensen · SIAM Journal on Scientific and Statistical Computing · 1987
In this paper we present a parallel algorithm for the symmetric algebraic eigenvalue problem. The algorithm is based upon a divide and conquer scheme suggested by Cuppen for computing the eigensystem of a symmetric tridiagonal matrix. We extend this idea to obtain a parallel algorithm that retains a number of active parallel processes that is greater than or equal to the initial number throughout the course of the computation. We give a new deflation technique which together with a robust root finding technique will assure computation of an eigensystem to full accuracy in the residuals and in the orthogonality of eigenvectors. A brief analysis of the numerical properties and sensitivity to round off error is presented to indicate where numerical difficulties may occur. The algorithm is able to exploit parallelism at all levels of the computation and is well suited to a variety of architectures. Computational results are presented for several machines. These results are very encouraging with respect to both accuracy and speedup. A surprising result is that the parallel algorithm, even when run in serial mode, can be significantly faster than the previously best sequential algorithm on large problems, and is effective on moderate size problems when run in serial mode.
Cited by 244 works. doi:10.1137/0908018
Authors
References
- Smoothing by spline functions
- The Levenberg-Marquardt algorithm: Implementation and theory
- Matrix Eigensystem Routines — EISPACK Guide
- Smoothing by spline functions. II
- Some Modified Matrix Eigenvalue Problems
- Rank-one modification of the symmetric eigenproblem
- Parallel Processing with Large-Grain Data Flow Techniques
- A divide and conquer method for the symmetric tridiagonal eigenproblem