On evaluating parallel sparse Cholesky factorizations
Resource
Parallel and Distributed Systems, 1994. International Conference on
Journal
Parallel and Distributed Systems, 1994. International Conference on
Pages
-
Date Issued
1994-12
Date
1994-12
Author(s)
Lin, Wen-Yang
Chen, Chuen-Liang
DOI
N/A
Abstract
Though many parallel implementations of sparse Cholesky factorization with the experimental results accompanied have been proposed, it seems hard to evaluate the performance of these factorization methods theoretically because of the irregular structure of sparse matrices. This paper is an attempt to such research. On the basis of the criteria of parallel computation and communication time, we successfully evaluate four widely adopted Cholesky factorization methods, including column-Cholesky, row-Cholesky, submatrix-Cholesky and multifrontal. The results show that the multifrontal method is superior to the others.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00590074.pdf
Size
533.12 KB
Format
Adobe PDF
Checksum
(MD5):4862e345cd80f4085fe9dc6b3c55dfc4