Implementation and performance evaluation of new inverse iteration algorithm with Householder transformation in terms of the compact WY representation
スポンサーリンク
概要
- 論文の詳細を見る
A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tridiagonal matrix on parallel computers is developed. In the classical inverse iteration, the modified Gram-Schmidt orthogonalization is used, and this 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 a 32-core parallel computer, and it is shown that the algorithm is up to 7.46 times faster than the classical algorithm in computing all the eigenvectors of matrices with several thousand dimensions.
- 2011-07-11
著者
-
Kinji Kimura
Kyoto University
-
Yoshimasa Nakamura
Kyoto University
-
Hiroyuki Ishigami
Graduate school of Informatics, Kyoto University
-
Kinji Kimura
Graduate school of Informatics, Kyoto University
-
Yoshimasa Nakamura
Graduate school of Informatics, Kyoto University
-
Hiroyuki Ishigami
Graduate School Of Informatics Kyoto University
関連論文
- Algebraic Approaches to Underdetermined Experiments in Biology
- Resultant-factorization Technique for Obtaining Solutions to Ordinary Differential Equations
- An Improved Shift Strategy for the Modified Discrete Lotka-Volterra with Shift Algorithm
- Implementation and performance evaluation of new inverse iteration algorithm with Householder transformation in terms of the compact WY representation
- Performance Evaluation of Some Inverse Iteration Algorithms on PowerXCellTM 8i Processor
- Improved Computation of Bounds for Positive Roots of Polynomials
- Implementation of the Orthogonal QD Algorithm for Lower Tridiagonal Matrices
- On Implementation and Evaluation of Inverse Iteration Algorithm with Compact WY Orthogonalization
- Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds