.png){kind=icon}
Return
A PARALLEL QZ ALGORITHM FOR DISTRIBUTED MEMORY HPC SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1137/140954817.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
generalized eigenvalue problem
nonsymmetric QZ algorithm
multishift
bulge chasing
infinite eigenvalues
parallel algorithms
level 3 performance
aggressive early deflation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
Thin-layer chromatographic methods for the analysis of eighteen different14C-labeled pesticides
.png){kind=icon}
PREAI
ShareSaveThe metabolism of N-nitrosomorpholine by rat liver microsomes and its oxidation by the Fenton system
PREAI
ShareSaveShareSave
ShareSave
ShareSave
View more