A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems

• Item type: Trans(1)
• 公開日: 2008-12-22
• タイトル: A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems
• タイトル / 言語: en
• タイトル: A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 数値計算
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Computational Science & Engineering Graduate School of Engineering Nagoya University
• 著者所属: Department of Computational Science & Engineering Graduate School of Engineering Nagoya University
• 著者所属: Department of Computational Science & Engineering Graduate School of Engineering Nagoya University
• 著者所属(英): en
• 著者所属(英): Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University
• 著者所属(英): en
• 著者所属(英): Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University
• 著者所属(英): en
• 著者所属(英): Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University
• 著者名: Takafumi, Miyata; Yusaku, Yamamoto; Shao-LiangZhang
• 著者名(英): Takafumi, Miyata; Yusaku, Yamamoto; Shao-Liang, Zhang
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In this paper we propose a fully pipelined multishift QR algorithm to compute all the eigenvalues of a symmetric tridiagonal matrix on parallel machines. Existing approaches for parallelizing the tridiagonal QR algorithm such as the conventional multishift QR algorithm and the deferred shift QR algorithm have suffered from either inefficiency of processor utilization or deterioration of convergence properties. In contrast our algorithm realizes both efficient processor utilization and improved convergence properties at the same time by adopting a new shifting strategy. Numerical experiments on a shared memory parallel machine (Fujitsu PrimePower HPC2500) with 32 processors show that our algorithm is up to 1.9 times faster than the conventional multishift algorithm and up to 1.7 times faster than the deferred shift algorithm.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In this paper, we propose a fully pipelined multishift QR algorithm to compute all the eigenvalues of a symmetric tridiagonal matrix on parallel machines. Existing approaches for parallelizing the tridiagonal QR algorithm, such as the conventional multishift QR algorithm and the deferred shift QR algorithm, have suffered from either inefficiency of processor utilization or deterioration of convergence properties. In contrast, our algorithm realizes both efficient processor utilization and improved convergence properties at the same time by adopting a new shifting strategy. Numerical experiments on a shared memory parallel machine (Fujitsu PrimePower HPC2500) with 32 processors show that our algorithm is up to 1.9 times faster than the conventional multishift algorithm and up to 1.7 times faster than the deferred shift algorithm.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11833852
• 書誌情報: 情報処理学会論文誌コンピューティングシステム（ACS）; 巻 1, 号 3, p. 14-27, 発行日 2008-12-22
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7829
• 出版者 / 言語: ja
• 出版者: 情報処理学会