Scalable iterative solution of sparse linear systems (Q1323641)

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.