Finding exact and approximate block structures for ILU preconditioning

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


Sparse matrices which arise in many applications often possess a block structure that can be exploited in iterative and direct solution methods. These block-matrices have as their entries small dense blocks with constant or variable dimensions. Block versions of incomplete LU factorizations which have been developed to take advantage of such structures give rise to a class of preconditioned that are among the most effective available. This paper presents general techniques for automatically determining block structures in sparse matrices. A standard "graph compression" algorithm used in direct sparse matrix methods is considered along with two other algorithms which are also capable of unraveling approximate block structures.

Original languageEnglish (US)
Pages (from-to)1107-1123
Number of pages17
JournalSIAM Journal on Scientific Computing
Issue number4
StatePublished - 2003


  • Block ILU preconditioners
  • Cosine-based graph compression
  • Graph Compression
  • Hash-based graph compression
  • Incomplete LU factorization
  • Indistinguishable nodes


Dive into the research topics of 'Finding exact and approximate block structures for ILU preconditioning'. Together they form a unique fingerprint.

Cite this