On aggressive early deflation in parallel variants of the QR algorithm
2011 (English)Conference paper (Refereed)
The QR algorithm computes the Schur form of a matrix and is by far the most popular approach for solving dense nonsymmetric eigenvalue problems. Multishift and aggressive early deflation (AED) techniques have led to significantly more efficient sequential implementations of the QR algorithm during the last decade. More recently, these techniques have been incorporated in a novel parallel QR algorithm on hybrid distributed memory HPC systems. While leading to significant performance improvements, it has turned out that AED may become a computational bottleneck as the number of processors increases. In this paper, we discuss a two-level approach for performing AED in a parallel environment, where the lower level consists of a novel combination of AED with the pipelined QR algorithm implemented in the ScaLAPACK routine PDLAHQR. Numerical experiments demonstrate that this new iplementation further improves the performance of the parallel QR algorithm.
Place, publisher, year, edition, pages
2011. Vol. 7134, 1-10 p.
, Lecture notes in computer science, ISSN 1611-3349
IdentifiersURN: urn:nbn:se:umu:diva-51058OAI: oai:DiVA.org:umu-51058DiVA: diva2:474631
PARA 2010, State of the Art in Scientific and Parallel Computing, in Reykjavík on June 6-9, 2010
ISSN-nummret i posten gäller den online versionen, finns även i tryckt version.
ISSN: 0302-9743 (Print) 1611-3349 (Online)2012-01-092012-01-092013-03-13Bibliographically approved