Scalable iterative solution of sparse linear systems
type: Item
instance of: scholarly article
title: Scalable iterative solution of sparse linear systems
zbMATH Open document ID: 0802.65034
DOI: 10.1016/0167-8191(94)90004-3
author: Mark Jones
author: Paul E. Plassmann
published in: Parallel Computing
publication date: 1994-12-11T00:00:00Z
review text: The conjugate gradient method preconditioned by an incomplete Cholesky factorization is considered. One method to minimize the number of major parallel steps is to choose an column ordering based on a coloring of the symmetric graph representing the nonzero adjacency structure of the matrix. The performance of the preconditioned conjugate gradient method using these coloring orderings is compared with a number of standard orderings on finite element matrices. Results from Intel iPSC/860 are given.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 579976
zbMATH Keywords: sparse linear systems
zbMATH Keywords: graph coloring
zbMATH Keywords: parallel algorithms
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: incomplete Cholesky factorization
zbMATH Keywords: performance
zbMATH Keywords: coloring orderings
zbMATH Keywords: finite element matrices
reviewed by: Horst Hollatz
MaRDI profile type: Publication
full work available at URL: 0167-8191(94)90004-3
OpenAlex ID: W1982182559
description: scientific article; zbMATH DE number 579976