An algorithm far the parallel computation of subsets of eigenvalues and associated eigenvectors of large symmetric matrices using an array processor

Author

Stuart, E.J. ; Weston, J.S.

Author_Institution

Dept. of Comput. Sci., Ulster Univ., Coleraine, UK

fYear

1993

fDate

27-29 Jan 1993

Firstpage

211

Lastpage

217

Abstract

The parallel implementation on an array processor and the mathematical basis of the POTS algorithm for the computation of subsets of eigenpairs of a real symmetric matrix of order n, 8⩽n⩽256 is discussed. An adaptation of the algorithm incorporating an acceleration technique is presented and contrasted with the original. Finally, the execution time efficiency of the algorithms for the computation of partial eigensolutions of a variety of matrices is presented, analysed and compared to that of a parallel Lanczos algorithm for the computation of subsets of eigenpairs of real symmetric matrices

Keywords

eigenvalues and eigenfunctions; mathematics computing; matrix algebra; parallel algorithms; POTS algorithm; array processor; associated eigenvectors; eigenpairs; large symmetric matrices; parallel Lanczos algorithm; parallel computation; parallel implementation; partial eigensolutions; real symmetric matrices; subsets of eigenvalues; Acceleration; Algorithm design and analysis; Concurrent computing; Costs; Data mining; Eigenvalues and eigenfunctions; Equations; Symmetric matrices; Visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings. Euromicro Workshop on

Conference_Location

Gran Canaria

Print_ISBN

0-8186-3610-6

Type

conf

DOI

10.1109/EMPDP.1993.336401

Filename

336401