A parallel algorithm for the symmetric eigenvalue problem

Author

Thio, Mike Gwan-Ming ; Dhall, S.K. ; Lakshmivarahan, S.

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Oklahoma Univ., Norman, OK, USA

fYear

1990

Firstpage

245

Lastpage

251

Abstract

A description is given of the authors´ experiences in implementing a divide-and-conquer-type parallel algorithm due to J.J. Cuppen (1981) on the Alliant multivector processor. An analysis of the algorithm and its implementation on the Alliant multivector processor are presented. To promote portability of parallel algorithms across various architectures, J.J. Dongarra and D.C. Sorenson (1987) recently developed a tool called SCHEDULE. Results obtained with and without SCHEDULE are compared

Keywords

eigenvalues and eigenfunctions; parallel algorithms; Alliant multivector processor; SCHEDULE; divide-and-conquer-type parallel algorithm; parallel algorithm; portability; symmetric eigenvalue problem; Algorithm design and analysis; Application software; Computer science; Concurrent computing; Eigenvalues and eigenfunctions; Parallel algorithms; Parallel processing; Processor scheduling; Software packages; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Applied Computing, 1990., Proceedings of the 1990 Symposium on

Conference_Location

Fayetteville, AR

Print_ISBN

0-8186-2031-5

Type

conf

DOI

10.1109/SOAC.1990.82176

Filename

82176

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1596007