密行列固有値解法の最近の発展(I) : Multiple Relatively Robust Representationsアルゴリズム(<特集>行列・固有値問題における線形計算アルゴリズムとその応用)

  • 山本 有作
    名古屋大学大学院工学研究科計算理工学専攻

書誌事項

タイトル別名
  • Recent Developments in Algorithms for Solving Dense Eigenproblems (I) : Algorithm of Multiple Relatively Robust Representations(<Special Issue>Algorithms for Matrix・Eigenvalue Problems and their Applications)
  • 特集:行列・固有値問題における線形計算アルゴリズムとその応用
  • トクシュウ ギョウレツ コユウチ モンダイ ニ オケル センケイ ケイサン アルゴリズム ト ソノ オウヨウ

この論文をさがす

抄録

The Algorithm of Multiple Relatively Robust Representations (MR^3) is a new algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem proposed by I. Dhillon in 1997. It has attracted much attention because it can compute all the eigenvectors of an n×n matrix in only O(n^2) work and is easy to parallelize. In this article, we survey the papers related to the MR^3 algorithm and try to present a simple and easily understandable picture of the algorithm by explaining, one by one, its key ingredients such as the relatively robust representations of a symmetric tridiagonal matrix, the dqds algorithm for computing accurate eigenvalues and the twisted factorization for computing accurate eigenvectors. Limitations of the algorithm and directions for future research are also discussed.

収録刊行物

被引用文献 (6)*注記

もっと見る

参考文献 (49)*注記

もっと見る

詳細情報

問題の指摘

ページトップへ