Elsevier

Parallel Computing

Volume 7, Issue 2, June 1988, Pages 199-210
Parallel Computing

A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor

https://doi.org/10.1016/0167-8191(88)90039-7Get rights and content

Abstract

We develop an algorithm for computing the symbolic Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forest. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness.

References (20)

There are more references available in the full text version of this article.

Cited by (0)

Publication of this report was partially supported by the National Science Foundation under grant DCR-8451385.

View full text