A PARALLEL HOUSEHOLDER TRIDIAGONALIZATION STRATAGEM USING SCATTERED ROW DECOMPOSITION

被引：4

作者：

CHANG, HY

UTKU, S

SALAMA, M

RAPP, D

机构：

[1] DUKE UNIV,DEPT CIVIL ENGN,DURHAM,NC 27706

[2] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706

[3] CALTECH,JET PROP LAB,PASADENA,CA 91109

来源：

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING | 1988年 / 26卷 / 04期

关键词：

COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL TECHNIQUES - Eigenvalues and Eigenfunctions;

D O I：

10.1002/nme.1620260408

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term 'Scattered Row Decomposition'. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.

引用

页码：857 / 873

页数：17