Highly Parallel Sparse Cholesky Factorization

  title={Highly Parallel Sparse Cholesky Factorization},
  author={John R. Gilbert and Robert Schreiber},
  journal={SIAM J. Scientific Computing},
We develop and compare several fine-grained parallel algorithms to compute the Cholesky factorisation of a sparse matrix. Our experimental implementations are on the Connection Machine, a distributedmemory 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. Our most… CONTINUE READING
58 Citations
20 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

The role of elimination trees in sparse factorization

  • J. W. H. Liu
  • SIAM Journal on MatrixAnalysis and Applications
  • 1990

A project for developing a linear algebra library for high-performance computers

  • Christian H. Bischof, Jack J. Dongarra
  • Technical Report MCS-P105-0989, Argonne National…
  • 1989
3 Excerpts

Spanning balanced trees in Boolean cubes

  • S. L. Johnsson
  • SIAM Journal onScienti c and Statistical…
  • 1989

On the complexity of sparse QR and LU factorization of niteelementmatrices

  • A. George, E. Ng
  • SIAM Journal on Scienti c and Statistical…
  • 1988

Sparse Cholesky factorization on a localmemorymultiprocessor

  • M. T. Heath A. George, J. Liu, E. Ng
  • SIAM Journal on Scienti c and Statistical…
  • 1988

Sparse Cholesky faetorization on a loca]-memory multiprocessor

  • Alan George, Michael T. Heath, Joseph Liu, Esmond Ng
  • SIAM Journal on Scientific and Statistical…
  • 1988
2 Excerpts

Sparse Choleslcy Factorization on a Multiprocessor

  • Earl Zmijewski
  • Phi) thesis, Cornell University,
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…