@article {14111,
	title = {Parallel sparse Cholesky factorization on a shared memory multiprocessor},
	journal = {Parallel Computing},
	volume = {18},
	year = {1992},
	month = {1992/09//},
	pages = {1009 - 1022},
	abstract = {Parallel implementations of Cholesky factorization for sparse symmetric positive definite matrices are considered on a shared memory multiprocessor computer. Two column-oriented schemes, known as the column-Cholesky algorithm and the fan-in algorithm, along with enhancements of each, are implemented and discussed. High parallel efficiency of the column-Cholesky algorithm and its enhancement is demonstrated for test problems. A detailed investigation of the performance of the fan-in algorithm and its enhancement, the compute-ahead fan-in algorithm, is made to study the effects of overhead associated with the fan-in based schemes.},
	keywords = {linear algebra, Parallel algorithms, shared memory multiprocessor, sparse Cholesky factorization},
	isbn = {0167-8191},
	doi = {16/0167-8191(92)90014-X},
	url = {http://www.sciencedirect.com/science/article/pii/016781919290014X},
	author = {Zhang, G. and Elman, Howard}
}
