Parallel performance of a symmetric eigensolver based on the Invariant Subspace Decomposition approach

Conference · Wed Jun 01 04:00:00 EDT 1994

OSTI ID:10159423

Bischof, C; Sun, X ^[1]; Huss-Lederman, S; Tsao, A; Turnbull, T ^[2]

---

1. Argonne National Lab., IL (United States)
2. Supercomputing Research Center, Bowie, MD (United States)

In this paper, we discuss work in progress on a complete eigensolver based on the Invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA). We describe a recently developed acceleration technique that substantially reduces the overall work required by this algorithm and review the algorithmic highlights of a distributed-memory implementation of this approach. These include a fast matrix-matrix multiplication algorithm, a new approach to parallel band reduction and tridiagonalization, and a harness for coordinating the divide-and-conquer parallelism in the problem. We present performance results for the dominant kernel, dense matrix multiplication, as well as for the overall SYISDA implementation on the Intel Touchstone Delta and the Intel Paragon.

• Research Organization: Argonne National Lab., IL (United States)
• Sponsoring Organization: USDOE, Washington, DC (United States); Department of Defense, Washington, DC (United States)
• DOE Contract Number: W-31109-ENG-38
• OSTI ID: 10159423
• Report Number(s): ANL/MCS/CP--82959; CONF-9405100--8; ON: DE94013314; CNN: Contract DM28EC4120
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200
ALGORITHMS
EIGENVALUES
EIGENVECTORS
ITERATIVE METHODS
MATHEMATICS AND COMPUTERS
NUMERICAL SOLUTION
PARALLEL PROCESSING