Parallel implementations of Jacobi's algorithm for the eigensolution of large matrices using array processors

  • J. S. Weston
  • M. Clint
  • C. W. Bleakney
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


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.


  1. 1.
    Fortran-Plus Enhanced, man 102.01, AMT (1990)Google Scholar
  2. 2.
    Modi, J. J., and J. D. Pryce, Efficient Implementation of Jacobi's Diagonalisation Method on the DAP, Numer. Math. 46, (1985) 443–454.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • J. S. Weston
    • 1
  • M. Clint
    • 2
  • C. W. Bleakney
    • 3
  1. 1.Department of Computing ScienceUniversity of Ulster at ColeraincColeraineNorthern Ireland
  2. 2.Department of Computer ScienceThe Queen's University of BelfastBelfastNorthern Ireland
  3. 3.Parallel Computer CentreThe Queen's University of BelfastBelfastNorthern Ireland

Personalised recommendations