A comparison of two parallel algorithms for the symmetric eigenproblem
- 1 January 1984
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 15 (1-4) , 291-302
- https://doi.org/10.1080/00207168408803415
Abstract
Two algorithms for the eigensolution of real symmetric matrices [8] are discussed. The first is a variant of the classical Jacobi method and the second is also based on orthogonal transforms. Both algorithms may be readily expressed in forms which allow the power of SIMD (single instruction multiple data) machines to be exploited. The performances of the algorithms on the ICL DAP (distributed array processor) and the CRAY-1 are compared.Keywords
This publication has 7 references indexed in Scilit:
- Non-numerical methods on parallel computersComputer Physics Communications, 1982
- A vector-multiplication dominated parallel algorithm for the computation of real eigenvalue spectraComputer Physics Communications, 1982
- A Survey of Parallel Algorithms in Numerical Linear AlgebraSIAM Review, 1978
- The CRAY-1 computer systemCommunications of the ACM, 1978
- A Survey of Parallelism in Numerical AnalysisSIAM Review, 1971
- On Jacobi and Jacobi-like algorithms for a parallel computerMathematics of Computation, 1971
- The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iterationThe Computer Journal, 1970