Abstract
In this paper two distinct ways of implementating a parallel version of Jacobi's algorithm are examined and each is implemented in two ways using a language which permits the use of a virtual array processor of arbitrary size. The performances of the four implementations of the algorithm for the computation of the eigensolution of matrices of maximum order 512 are compared when executed on an AMT DAP 510 and on an AMT DAP 610.
References
Fortran-Plus Enhanced, man 102.01, AMT (1990)
Modi, J. J., and J. D. Pryce, Efficient Implementation of Jacobi's Diagonalisation Method on the DAP, Numer. Math. 46, (1985) 443–454.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weston, J.S., Clint, M., Bleakney, C.W. (1992). Parallel implementations of Jacobi's algorithm for the eigensolution of large matrices using array processors. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_489
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_489
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive