Parallelizing preconditioned conjugate gradient algorithms

Anne Greenbaum, Congming Li, Han Zheng Chao

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Various iterative methods for solving the linear systems associated with finite element approximations to self-adjoint elliptic differential operators are compared based on their performance on serial and parallel machines. The methods studied are all preconditioned conjugate gradient methods, differing only in the choice of preconditioner. The preconditioners considered arise from diagonal scaling, incomplete Cholesky decomposition, hierarchical basis functions and an additive Schwarz domain decomposition technique. The hierarchical basis function idea is shown to be especially effective for 2-D problems on both serial and parallel architectures. For 3-D problems, the additive Schwarz method appears promising.

Original languageEnglish (US)
Pages (from-to)295-309
Number of pages15
JournalComputer Physics Communications
Issue number1-3
StatePublished - May 1989
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • General Physics and Astronomy


Dive into the research topics of 'Parallelizing preconditioned conjugate gradient algorithms'. Together they form a unique fingerprint.

Cite this