On pole-swapping algorithms for the eigenvalue problem.

ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS(2020)

引用 4|浏览5
暂无评分
摘要
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is developed. A key component of all such algorithms is a procedure that swaps two adjacent eigenvalues in a triangular pencil. An improved swapping routine is developed, and its superiority over existing methods is demonstrated by a backward error analysis and numerical tests. The modularity of the new convergence theory and the generality of the pole-swapping approach shed new light on bi-directional chasing algorithms, optimally packed shifts. and bulge pencils, and allow the design of novel algorithms.
更多
查看译文
关键词
eigenvalue,QZ algorithm,pole swapping,convergence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要