A Parallel QZ Algorithm for Distributed Memory HPC Systems

Appearing frequently in applications, generalized eigenvalue problems represent one of the core problems in numerical linear algebra. The QZ algorithm of Moler and Stewart is the most widely used algorithm for addressing such problems. Despite its importance, little attention has been paid to the pa...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific computing Vol. 36; no. 5; pp. C480 - C503
Main Authors: Adlerborn, Björn, Kågström, Bo, Kressner, Daniel
Format: Journal Article
Language:English
Published: 01.01.2014
Subjects:
1993
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
aggressive early deflation
Algorithms
bulge chasing
Computation
Distributed memory
Eigenvalues
generalized eigenvalue problem
infinite genvalues
Ingredients
level 3 performance
Linear algebra
MMEL J
multishift
nonsymmetric QZ algorithm
P175
parallel algorithms
Parallel processing
Strategy
V19
ISSN:1064-8275, 1095-7197, 1095-7197
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Appearing frequently in applications, generalized eigenvalue problems represent one of the core problems in numerical linear algebra. The QZ algorithm of Moler and Stewart is the most widely used algorithm for addressing such problems. Despite its importance, little attention has been paid to the parallelization of the QZ algorithm. The purpose of this work is to fill this gap. We propose a parallelization of the QZ algorithm that incorporates all modern ingredients of dense eigensolvers, such as multishift and aggressive early deflation techniques. To deal with (possibly many) infinite eigenvalues, a new parallel deflation strategy is developed. Numerical experiments for several random and application examples demonstrate the effectiveness of our algorithm on two different distributed memory HPC systems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1064-8275
1095-7197
1095-7197
DOI:10.1137/140954817