A W-matrix methodology for solving sparSe network equations on multiprocessor computers
Journal Article
·
· IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States)
- UNESP-Ilha Solteira (BR)
- UNICAMP-Campinas (BR)
This paper describes a methodology for solving efficiently the 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 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.
- OSTI ID:
- 7102346
- Journal Information:
- IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 7:3; ISSN ITPSE; ISSN 0885-8950
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sparse Cholesky factorization on a multiprocessor
Parallel solution of sparse linear systems on a vector multiprocessor computer. Master's thesis, August 1988-August 1990
Communication reduction in parallel sparse Cholesky factorization on a hypercube
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:7183866
Parallel solution of sparse linear systems on a vector multiprocessor computer. Master's thesis, August 1988-August 1990
Technical Report
·
Mon Jul 30 00:00:00 EDT 1990
·
OSTI ID:6204751
Communication reduction in parallel sparse Cholesky factorization on a hypercube
Conference
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7043785