On evaluating elimination-tree based parallel sparse Cholesky factorizations
Resource
International Journal of Computer Mathematics,74,361-377.
Journal
International Journal of Computer Mathematics
Pages
361-377
Date Issued
1999-08
Date
1999-08
Author(s)
Chen, W. Y.
Lin, C. L.
Abstract
Abstract Though a variety of parallel sparse Cholesky factorizations have been developed and diverse experiments on various machines have been reported, there is still a lack of theoretical evaluations because of the irregular structure of sparse matrices. This study is an effort on such research. On the basis of the elimination tree model, we compared the computation and communication perspective of four widely adopted parallel Cholesky factorization methods, including column-Cholesky, row-Cholesky, submatrix-Cholesky and multifrontal. The results show that the multifrontal method is superior to the others. Keywords: Distributed-memory multiprocessorsparse matrixparallel factorizationequivalent reorderingelimination treeAMS Subject Classifications: 05C5065F5065Y05C.R. Categories: G1.3F2.1G2.2
Type
journal article