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 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.

Published in:
SIAM Journal On Scientific Computing, 36, 5, C480-C503
Philadelphia, Siam Publications

 Record created 2015-02-20, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)