A parallel algorithm for elimination tree computation and symbolic factorization (original) (raw)

A parallel algorithm for elimination tree computation and symbolic factorization

Parallel Computing, 1992

Abstract

The notion of an elimination tree plays a very important role in the parallel algorithms for sparse Cholesky decomposition, symbolic factorization and in determining the mapping of columns of the matrix to processors. In this paper, we present a parallel algorithm to compute the ...

Anupam Basu hasn't uploaded this paper.

Let Anupam know you want this paper to be uploaded.

Ask for this paper to be uploaded.