## Highly Parallel Sparse Cholesky Factorization (1992)

Venue: | SIAM Journal on Scientific and Statistical Computing |

Citations: | 42 - 1 self |

### BibTeX

@ARTICLE{Gilbert92highlyparallel,

author = {John R. Gilbert and Robert Schreiber},

title = {Highly Parallel Sparse Cholesky Factorization},

journal = {SIAM Journal on Scientific and Statistical Computing},

year = {1992},

volume = {13},

pages = {1151--1172}

}

### Years of Citing Articles

### OpenURL

### Abstract

We develop and compare several fine-grained parallel algorithms to compute the Cholesky factorization of a sparse matrix. Our experimental implementations are on the Connection Machine, a distributed-memory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special-purpose algorithms in which the matrix structure conforms to the connection structure of the machine, our focus is on matrices with arbitrary sparsity structure.