A study of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices
Conference
·
OSTI ID:10160866
- Argonne National Lab., IL (United States)
- Supercomputing Research Center, Bowie, MD (United States)
In this paper, we give an overview of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices and describe a sequential implementation of this algorithm. Our implementation uses a specialized routine for performing banded matrix multiplication together with successive band reduction, yielding a sequential algorithm that is competitive for large problems with the LAPACK QR code in computing all of the eigenvalues and eigenvectors of a dense symmetric matrix. Performance results are given on a variety of machines.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 10160866
- Report Number(s):
- ANL/MCS/CP--83197; CONF-9406184--1; ON: DE94013872
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel studies of the invariant subspace decomposition approach 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
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125570
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