Parallel studies of the invariant subspace decomposition approach for banded symmetric matrices
Conference
·
OSTI ID:125570
- Argonne National Lab., IL (United States)
- Supercomputing Research Center, Bowie, MD (United States); and others
We present an overview of the banded Invariant Subspace Decomposition Algorithm for symmetric matrices and describe a parallel implementation of this algorithm. The algorithm described here is a promising variant of the Invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA) that retains the property of using scalable primitives, while requiring significantly less overall computation than SYISDA.
- Research Organization:
- Argonne National Laboratory (ANL), Argonne, IL
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 125570
- Report Number(s):
- CONF-950212--; CNN: Contract DM28E04120
- Country of Publication:
- United States
- Language:
- English
Similar Records
A study of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices
A parallel implementation of the invariant subspace decomposition algorithm for dense symmetric matrices
Parallel performance of a symmetric eigensolver based on the Invariant Subspace Decomposition approach
Conference
·
Wed Jun 01 00:00:00 EDT 1994
·
OSTI ID:10160866
A parallel implementation of the invariant subspace decomposition algorithm for dense symmetric matrices
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:54430
Parallel performance of a symmetric eigensolver based on the Invariant Subspace Decomposition approach
Conference
·
Wed Jun 01 00:00:00 EDT 1994
·
OSTI ID:10159423