Minimum communication cost reordering for parallel sparse Cholesky factorization
type: Item
instance of: scholarly article
title: Minimum communication cost reordering for parallel sparse Cholesky factorization
zbMATH Open document ID: 0930.68019
DOI: 10.1016/S0167-8191(99)00027-7
author: Wen-Yang Lin
author: Chuen-Liang Chen
published in: Parallel Computing
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68M99
zbMATH DE Number: 1387487
zbMATH Keywords: communication cost
zbMATH Keywords: distributed-memory multiprocessor
zbMATH Keywords: sparse matrix
zbMATH Keywords: parallel factorization
zbMATH Keywords: equivalent reordering
zbMATH Keywords: elimination tree
MaRDI profile type: Publication
full work available at URL: s0167-8191(99)00027-7
OpenAlex ID: W2021413160
description: scientific article; zbMATH DE number 1387487