A divide and conquer approach to the nonsymmetric eigenvalue problem
Conference
·
OSTI ID:5903287
Serial computation combined with high communication costs on distributed-memory multiprocessors make parallel implementations of the QR method for the nonsymmetric eigenvalue problem inefficient. This paper introduces an alternative algorithm for the nonsymmetric tridiagonal eigenvalue problem based on rank two tearing and updating of the matrix. The parallelism of this divide and conquer approach stems from independent solution of the updating problems. 11 refs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- Sponsoring Organization:
- USDOE; USDOE, Washington, DC (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5903287
- Report Number(s):
- CONF-910771-2; ON: DE91011085
- Resource Relation:
- Conference: 13. IMACS world congress on computation and applied mathematics, Dublin (Ireland), 22-26 Jul 1991
- Country of Publication:
- United States
- Language:
- English
Similar Records
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
Technical Report
·
Sun Dec 01 00:00:00 EST 1991
·
OSTI ID:5903287
A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
Technical Report
·
Sun Dec 01 00:00:00 EST 1991
·
OSTI ID:5903287
A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
Journal Article
·
Thu Jul 01 00:00:00 EDT 1999
· SIAM Journal on Scientific Computing
·
OSTI ID:5903287