Scalable iterative solution of sparse linear systems (Q1323641): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587825
Property / reviewed by
 
Property / reviewed by: Horst Hollatz / rank
Normal rank
 

Revision as of 11:18, 16 February 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
    0 references
    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

    Identifiers