Parallel implementation of a symmetric eigensolver based on the Yau and Lu method

Domas, Stéphane and Tisseur, Françoise (1997) Parallel implementation of a symmetric eigensolver based on the Yau and Lu method. In: Lecture Notes in Computer Science. Lecture Notes in Computer Science, 1215 . Springer Berlin / Heidelberg, Berlin, pp. 140-153. ISBN 978-3-540-62828-6

PDF tisseur_7.pdf Download (653kB)

Abstract

In this paper, we present preliminary results on a complete eigensolver based on the Yau and Lu method. We first give an overview of this invariant subspace decomposition method for dense symmetric matrices followed by numerical results and work in progress of a distributed-memory implementation. We expect that the algorithm's heavy reliance on matrix-matrix multiplication, coupled with FFT should yield a highly parallelizable algorithm. We present performance results for the dominant computation kernel on the Intel Paragon.

Item Type:	Book Section
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:	Ms Lucy van Russelt
Date Deposited:	05 Dec 2007
Last Modified:	20 Oct 2017 14:12
URI:	https://eprints.maths.manchester.ac.uk/id/eprint/985

Actions (login required)

View Item