Parallel two level block ILU preconditioning techniques for solving large sparse linear systems

Chi Shen, Jun Zhang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We implement a parallel preconditioner for solving general sparse linear systems based on a two level block ILU factorization strategy. We give some new data structures and strategies to construct a local coefficient matrix and a local Schur complement matrix on each processor. The preconditioner constructed is fast and robust for solving certain large sparse matrices. Numerical experiments show that our domain based two level block ILU preconditioners are more robust and more efficient than some published ILU preconditioners based on Schur complement techniques for parallel sparse matrix solutions.

Original languageEnglish
Pages (from-to)1451-1475
Number of pages25
JournalParallel Computing
Issue number10
StatePublished - Oct 2002


  • Domain decomposition
  • Parallel preconditioning
  • Schur complement techniques
  • Sparse matrices

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence


Dive into the research topics of 'Parallel two level block ILU preconditioning techniques for solving large sparse linear systems'. Together they form a unique fingerprint.

Cite this