Parallel Implementation of the Yau and Lu Method for Eigenvalue Computation

Tisseur, Françoise (1997) Parallel Implementation of the Yau and Lu Method for Eigenvalue Computation. International Journal of Supercomputer Applications and High Performance Computing, 11 (3). pp. 197-204. ISSN 1741-2846

PDF tiss97.pdf Restricted to Registered users only Download (439kB)

Abstract

In this paper, parallel extensions of a complete symmetric eigensolver, proposed by Yau and Lu in 1993, are pre sented. First, an overview of this invariant subspace decomposition method for dense symmetric matrices is given, followed by numerical results. Then, works are exposed in progress on distributed-memory implementa tion. The algorithm's heavy reliance on matrix-matrix mul tiplication, coupled with Fast Fourier Transform (FFT), should yield a highly parallelizable algorithm. Finally, performance results for the dominant computation kernel on the Intel Paragon are presented.

Item Type:	Article
Subjects:	MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
Depositing User:	Nick Higham
Date Deposited:	12 Apr 2007
Last Modified:	20 Oct 2017 14:12
URI:	https://eprints.maths.manchester.ac.uk/id/eprint/775

Actions (login required)

View Item