A parallel algorithm for the non-symmetric eigenvalue problem

Miscellaneous · Tue Jan 01 00:00:00 EST 1991

OSTI ID:7158562

Sidani, M M

An algorithm is presented for the solution of the non-symmetric eigenvalue problem. The algorithm is based on a divide-and-conquer procedure that provides initial approximations to the eigenpairs, which are then refined using Newton iterations. Since the smaller subproblems can be solved independently, and since Newton iterations with different initial guesses can be started simultaneously, the algorithm - unlike the standard QR method - is ideal for parallel computers. The author also reports on his investigation of deflation methods designed to obtain further eigenpairs if needed. Numerical results from implementations on a host of parallel machines (distributed and shared-memory) are presented.

• Research Organization: Tennessee Univ., Knoxville, TN (United States)
• OSTI ID: 7158562
• Resource Relation: Other Information: Thesis (Ph.D.)
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
EIGENVALUES
ALGORITHMS
ASYMMETRY
IMPLEMENTATION
ITERATIVE METHODS
PARALLEL PROCESSING
MATHEMATICAL LOGIC
PROGRAMMING
661100* - Classical & Quantum Mechanics- (1992-)
990200 - Mathematics & Computers