๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations

โœ Scribed by Lin, Wen-Yang; Chen, Chuen-Liang

Book ID
118216057
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
251 KB
Volume
27
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum communication cost reordering fo
Minimum communication cost reordering for parallel sparse Cholesky factorization
โœ Wen-Yang Lin; Chuen-Liang Chen ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

In this paper, we consider the problem of reducing the communication cost for the parallel factorization of a sparse symmetric positive deยฎnite matrix on a distributed-memory multiprocessor. We deยฎne a parallel communication cost function and show that, with a contrived example, simply minimizing th