A parallel algorithm for the nonsymmetric eigenvalue problem
Journal Article
·
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
- Univ. of Tennessee, Knoxville (United States)
- Oak Ridge National Lab., TN (United States)
The algebraic eigenvalue problem is one of the fundamental problems in computational mathematics. It arises in many applications and therefore represents an important area of algorithmic research. The problem has received considerable attention, which has resulted in reliable methods. However, it is reasonable to expect that calculations might be accelerated through the use of parallel algorithms. This paper describes a parallel algorithm for computing the eigenvalues and eigenvectors of a nonsymmetric matrix. The algorithm is based on a divide-and-conquer procedure and uses an iterative refinement technique.
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6455506
- Journal Information:
- SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States), Journal Name: SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States) Vol. 14:3; ISSN 0196-5204; ISSN SIJCD4
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel algorithm for the non-symmetric eigenvalue problem
A parallel algorithm for the non-symmetric eigenvalue problem
A divide and conquer approach to the nonsymmetric eigenvalue problem
Technical Report
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:5918093
A parallel algorithm for the non-symmetric eigenvalue problem
Technical Report
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:10108033
A divide and conquer approach to the nonsymmetric eigenvalue problem
Conference
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:5903287