Abstract
We present a parallel algorithm for symbolic Cholesky factorization of sparse symmetric matrices. The symbolic factorization algorithm complements a parallel numeric factorization algorithm published earlier. The implementation is designed for a message-passing, distributed-memory multiprocessor. In addition to discussing the basic algorithm and data structures required, we also describe two enhancements that improve performance. Empirical test results obtained on an Intel iPSC hypercube are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
