By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Stuart, E.J. ; Dept. of Comput. Sci., Ulster Univ., Coleraine, UK ; Weston, J.S.

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

Published in:

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

Date of Conference:

27-29 Jan 1993