arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.1910math.NAcs.NA
收藏

紧凑WY正交化的逆迭代算法的实现与评估

On Implementation and Evaluation of Inverse Iteration Algorithm with compact WY Orthogonalization

Kyoto University(京都大学)

Hiroyuki Ishigami, Kinji Kimura, Yoshimasa Nakamura

AI总结:

提出一种使用紧凑WY表示和Householder变换的逆迭代算法,以降低并行计算中的同步开销,并在多核计算机上显著加速数千维矩阵所有特征向量的计算。

摘要:

开发了一种新的逆迭代算法,可用于在并行计算机上计算实对称三对角矩阵的所有特征向量。经典逆迭代中使用改进的Gram-Schmidt正交化,该算法是顺序的,在并行计算中造成瓶颈。本文提出在逆迭代的正交化过程中使用紧凑WY表示和Householder变换。这一改变显著降低了并行计算中的同步开销。在8核和32核并行计算机上评估了新算法,结果表明,在计算数千维矩阵的所有特征向量时,新算法比经典逆迭代算法快得多。

英文摘要:

A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tri-diagonal matrix on parallel computers is developed. The modified Gram-Schmidt orthogonalization is used in the classical inverse iteration. This algorithm is sequential and causes a bottleneck in parallel computing. In this paper, the use of the compact WY representation is proposed in the orthogonalization process of the inverse iteration with the Householder transformation. This change results in drastically reduced synchronization cost in parallel computing. The new algorithm is evaluated on both an 8-core and a 32-core parallel computer, and it is shown that the new algorithm is greatly faster than the classical inverse iteration algorithm in computing all the eigenvectors of matrices with several thousand dimensions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑