Abstract
We present a parallel algorithm for reducing a dense symmetric matrix
to tridiagonal form. The algorithm employs a square torus-wrap mapping
of matrix elements to processors to reduce communication and uses
level 3 BLAS routines for efficient numerical kernels. We demonstrate
the efficiency of this approach with performance results on the Intel
Paragon.
Users
Please
log in to take part in the discussion (add own reviews or comments).