A W-matrix methodology for solving sparse network equations on multiprocessor computers

The authors describe a methodology for solving efficiently sparse network equations on multiprocessor computers. The methodology is based on the matrix inverse factors (W-matrix) approach to the direct solution phase of Ax=b systems. A partitioning scheme of the W-matrix, based on the leaf-nodes of the factorization path tree, is proposed. The methodology allows the performance of all the updating operations on vector b in parallel, within each partition, using a row-oriented processing. The approach takes advantage of the processing power of the individual processors. Performance results are presented and discussed.<
>