A new successive relaxation scheme for the W-matrix solution method on a shared memory parallel computer

Author

Wu, Jun Qiang ; Bose, Anjan

Author_Institution

Arizona State Univ., Tempe, AZ, USA

Volume

11

Issue

1

fYear

1996

fDate

2/1/1996 12:00:00 AM

Firstpage

233

Lastpage

238

Abstract

The W-matrix method has the potential to be efficient for parallel computing as a substitute for the precedence stringent substitution schemes, which are being commonly used on sequential computers for the solution of sparse linear matrix equations, with the support of appropriate reordering and partitioning algorithms. In this paper, the factors which may affect the performance of the W-matrix method are examined first. A bus reordering and partitioning scheme is then proposed which is aimed at reducing the fill-ins in both the triangular matrices L and U and the W-matrices and adjusting the patterns of the W-matrices for better parallel efficiency. Tests conducted on a shared memory parallel computer proved the effectiveness of the proposed algorithm for various systems. Test results are presented and discussed,

Keywords

matrix inversion; parallel processing; power system analysis computing; relaxation theory; shared memory systems; sparse matrices; W-matrix solution method; bus partitioning; bus reordering; linear system; parallel algorithms; parallel efficiency; partial matrix inversion; partitioning algorithms; power systems; reordering algorithms; shared memory parallel computer; sparse linear matrix equations; triangular matrices; Concurrent computing; Equations; Linear systems; Matrix converters; Parallel algorithms; Parallel processing; Partitioning algorithms; Sparse matrices; Symmetric matrices; System testing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.486100

Filename

486100