Email RIS file
Bookmark
Report an Issue

Symmetric eigenvalue problem on a multiprocessor

Author
Lo, S. S.
Published
United States : [publisher not identified], 1986
Springfield, Va.: National Technical Information Service, [approximately 1986]
Physical Description
microfiche : negative ; 11 x 15 cm
Additional Creators
Philippe, B.

Availability

Browse Nearby on Shelf
I Want It
I Want It

Finding items...

Summary
This paper is a survey of optimal methods for solving the symmetric eigenvalue problem on a multiprocessor. Although the inherent parallelism of the Jacobi method is well known, the convergence is not insured and the total number of operations is larger than that of the methods which transform the full matrix into a tridiagonal matrix. In this paper we are concerned with the methods which deal with the tridiagonalized eigenvalue systems. We review the sequential methods for solving symmetric eigenvalue problems by tridiagonal reduction using the appropriate routines from EISPACK. We also discuss the different ways of exploiting parallelism, examples of linear recurrence and orthogonalization are presented. Section 4 and Section 5 deal with the two algorithms, SESUPD, a parallel version of TQL2 in EISPACK, and TREPS, a parallel version of BISECT + TINVIT, respectively.
Report Numbers
DE87002103; DOE/ER/25001-13
Other Subject(s)
Collection
NTIS collection.
Note
DOE contract number: FG02-85ER25001
OSTI Identifier 7008107
Research organization: Illinois Univ., Urbana (USA). Center for Supercomputing Research and Development.
Research organization: Institut National de Recherche d'Informatique et d'Automatique (INRIA), 35 - Rennes (France).
View MARC record | catkey: 47370922