Scalable iterative solution of sparse linear systems (Q1323641): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(94)90004-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982182559 / rank | |||
Normal rank | |||
Latest revision as of 18:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scalable iterative solution of sparse linear systems |
scientific article |
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
