Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
W.-Y. Lin, C. L. Chen. Minimum communication cost reordering for parallel sparse Cholesky factorization. Parallel Computing, 25(8):943-967, 1999.
Possibly Related PublicationsThe following publications are possibly variants of this publication: On Optimal Reorderings of Sparse Matrices for Parallel Cholesky FactorizationsWen-Yang Lin, Chuen-Liang Chen. siammax, 27(1):24-45, 2005. [doi] Minimum Completion Time Criterion for Parallel Sparse Cholesky FactorizationWen-Yang Lin, Chuen-Liang Chen. icpp 1993: 107-114 On Evaluating Parallel Sparse Cholesky FactorizationsW.-Y. Lin, C. L. Chen. icpads 1994: 162-167
The following publications are possibly variants of this publication: