An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

Edward Rothberg, Anoop Gupta
1994 SIAM Journal on Scientific Computing  
This paper explores the use o f a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalabiliry advantages over more traditional column-oriented andpanel-oriented decompositions. However. little progress has been made in producing a practical sub-block method. This paper proposes and evaluates an approach that is simple to implement, provides slightly higher
more » ... rmance than column (and panel) merhods on small parallel machines, and has the potential to provide much higher performance on large parallel machines.
doi:10.1137/0915085 fatcat:47rvici4qrdbrkb3un5yomxqgm