A rank-two divide and conquer method for the symmetric tridiagonal eigenproblem

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234887

K. Gates

引用次数: 0

Abstract

A rank-two divide and conquer algorithm is developed for calculating the eigensystem of a symmetric tridiagonal matrix. This algorithm is compared to the LAPACK recommended path for this problem and the rank-one divide and conquer algorithm. The timing results on a Sequent Symmetry S81b show that this algorithm has potential as a parallel alternative to the QR algorithm.<>

查看原文本刊更多论文

对称三对角线特征问题的二阶分治方法

提出了一种计算对称三对角矩阵特征系统的二阶分治算法。将该算法与针对该问题的LAPACK推荐路径和排名第一的分治算法进行比较。在Sequent Symmetry S81b上的时序结果表明，该算法有潜力作为QR算法的并行替代方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量