Minimum communication cost reordering for parallel sparse Cholesky factorization

DOI10.1016/S0167-8191(99)00027-7zbMath0930.68019OpenAlexW2021413160MaRDI QIDQ1960600

Wen-Yang Lin, Chuen-Liang Chen

Publication date: 12 January 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(99)00027-7

zbMATH Keywords

sparse matrixelimination treecommunication costdistributed-memory multiprocessorparallel factorizationequivalent reordering

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (1)

A survey of direct methods for sparse linear systems

This page was built for publication: Minimum communication cost reordering for parallel sparse Cholesky factorization