密行列固有値解法の最近の発展(II) : マルチシフトQR法

機関リポジトリ 機関リポジトリ (HANDLE) オープンアクセス

書誌事項

タイトル別名
  • Recent Developments in Algorithms for Solving Dense Eigenproblems (II) : Multishift QR Algorithms

説明

The QR algorithm is one of the most reliable and widely used methods to compute the eigenvalues of symmetric and nonsymmetric matrices. However, it is not straightforward to execute the QR algorithm efficiently on modern architectures such as processors with hierarchical memory or parallel computers because of its inherent sequential nature and low data reference locality. To overcome this difficulty, Bai & Demmel proposed the multishift QR algorithm in 1989 and this idea has been greatly expanded since then. In this paper, we introduce the basic theory of the multishift QR algorithm and review recent developments to improve its efficiency, such as the two-tone QR algorithm, aggressive early deflation and the fully-pipelined multishift QR algorithm. Directions for future research are also discussed.

収録刊行物

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ