.png){kind=icon}
返回
A PARALLEL QZ ALGORITHM FOR DISTRIBUTED MEMORY HPC SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1137/140954817.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
generalized eigenvalue problem
nonsymmetric QZ algorithm
multishift
bulge chasing
infinite eigenvalues
parallel algorithms
level 3 performance
aggressive early deflation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Thin-layer chromatographic methods for the analysis of eighteen different14C-labeled pesticides
.png){kind=icon}
PREAI
分享收藏The metabolism of N-nitrosomorpholine by rat liver microsomes and its oxidation by the Fenton system
PREAI
分享收藏
Multiple reversals of vortex ratchet effects in a superconducting strip with inclined dynamic pinning landscape*超导条带中倾斜动态钉扎势景观下涡旋棘轮效应的多次反转*
PREAI
分享收藏
查看更多内容