Scalable iterative solution of sparse linear systems (Q1323641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scalable iterative solution of sparse linear systems |
scientific article; zbMATH DE number 579976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scalable iterative solution of sparse linear systems |
scientific article; zbMATH DE number 579976 |
Statements
Scalable iterative solution of sparse linear systems (English)
0 references
11 December 1994
0 references
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.
0 references
sparse linear systems
0 references
graph coloring
0 references
parallel algorithms
0 references
conjugate gradient method
0 references
incomplete Cholesky factorization
0 references
performance
0 references
coloring orderings
0 references
finite element matrices
0 references
0.8640309572219849
0 references
0.8585324287414551
0 references
0.845942497253418
0 references
