A parallel algorithm for the non-symmetric eigenvalue problem
- Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science
This paper describes a parallel algorithm for computing the eigenvalues and eigenvectors of a non-symmetric matrix. The algorithm is based on a divide-and-conquer procedure and uses an iterative refinement technique.
- Research Organization:
- Oak Ridge National Lab., TN (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 10108033
- Report Number(s):
- ORNL/TM--12003; ON: DE92004087
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel algorithm for the non-symmetric eigenvalue problem
A parallel algorithm for the nonsymmetric eigenvalue problem
A parallel algorithm for the non-symmetric eigenvalue problem
Technical Report
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:5918093
A parallel algorithm for the nonsymmetric eigenvalue problem
Journal Article
·
Sat May 01 00:00:00 EDT 1993
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:6455506
A parallel algorithm for the non-symmetric eigenvalue problem
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:7158562