A parallel implementation of the invariant subspace decomposition algorithm for dense symmetric matrices
Conference
·
OSTI ID:54430
- Supercomputing Research Center, Bowie, MD (United States)
- CONVEX Computer Corp., Richardson, TX (United States)
We give an overview of the Invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA) by first describing the algorithm, followed by a discussion of a parallel implementation of SYISDA on the Intel Delta. Our implementation utilizes an optimized parallel matrix multiplication implementation we have developed. Load balancing in the costly early stages of the algorithm is accomplished without redistribution of data between stages through the use of the block scattered decomposition. Computation of the invariant subspaces at each stage is done using a new tridiagonalization scheme due to Bischof and Sun.
- OSTI ID:
- 54430
- Report Number(s):
- DOE/ER/25151--1-Vol.1; CONF-930331--Vol.1; CNN: Contract DM28E04120
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel performance of a symmetric eigensolver based on the Invariant Subspace Decomposition approach
Parallel studies of the invariant subspace decomposition approach for banded symmetric matrices
A study of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices
Conference
·
Wed Jun 01 00:00:00 EDT 1994
·
OSTI ID:10159423
Parallel studies of the invariant subspace decomposition approach for banded symmetric matrices
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125570
A study of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices
Conference
·
Wed Jun 01 00:00:00 EDT 1994
·
OSTI ID:10160866