Parallel Algorithm for Transformation of a Symmetric Band Matrix to Tridiagonal Form on a Ring-shaped Processor Array
スポンサーリンク
概要
- 論文の詳細を見る
Parallel computation of the extended Householder's algorithm is considered. The extended Householder's method is used to transform an nxn synmetric band matrix with 2m+1 bandwidth into tridiagonal from within a band store in O(n^3m) computing time. We propose a parallel algorithm for this extended House-holder's tridiagonalization, and show that our parallel algorithm is nicely implemented on a ring-shaped array of processors reducing the computing time to O(nm^2).
- 一般社団法人情報処理学会の論文
- 1984-02-05
著者
-
Kohata Masaki
Faculty Of Systems Engineering Kobe University
-
Kaneda Yukio
Faculty Of Systems Engineering Kobe University
-
Kaneda Yukio
Faculty Of Engineering Kobe University
関連論文
- The Structured Design Method of Simulation Programs
- Parallel Algorithm for Transformation of a Symmetric Band Matrix to Tridiagonal Form on a Ring-shaped Processor Array