Independent set orderings for parallel matrix factorization by Gaussian elimination
type: Item
instance of: scholarly article
title: Independent set orderings for parallel matrix factorization by Gaussian elimination
zbMATH Open document ID: 0681.65013
DOI: 10.1016/0167-8191(89)90016-1
author: Michael R. Leuze
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
review text: Experiments and discussions comparing various approaches to ordering matrices for parallel factorization by Gaussian elimination are presented. The techniques designed to reduce fill are reviewed. As an alternative, the strategy of independent set ordering is proposed, aiming to maximize the number of independent operations that can be produced simultaneously. Cost and performance analyses are also given.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 4115822
zbMATH Keywords: matrix ordering
zbMATH Keywords: parallel factorization
zbMATH Keywords: Gaussian elimination
MaRDI profile type: Publication
full work available at URL: 0167-8191(89)90016-1
OpenAlex ID: W1980416455
Recommended article: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
Recommended article: Q4728100
Recommended article: Reordering sparse matrices for parallel elimination
Recommended article: Distributed Sparse Gaussian Elimination and Orthogonal Factorization
Recommended article: Assignment and scheduling in parallel matrix factorization
Recommended article: Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
Recommended article: On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: Parallelization of the GreConD algorithm for Boolean matrix factorization
description: scientific article; zbMATH DE number 4115822