Finding Exact and Approximate Block Structures for ILU Preconditioning

DOI10.1137/S1064827501393393zbMath1034.65020OpenAlexW2016106447MaRDI QIDQ4442104

Yousef Saad

Publication date: 20 January 2004

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827501393393

zbMATH Keywords

algorithmsnumerical examplessparse matricesincomplete LU factorizationgraph compressionblock-matricesblock ILU preconditionerscosine-based graph compressionhash-based graph compressionindistinguishable nodes

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A Block Compression Algorithm for Computing Preconditioners ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ A high performance level-block approximate LU factorization preconditioner algorithm ⋮ VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems ⋮ Preconditioning techniques for large linear systems: A survey ⋮ A comparison of stiff ODE solvers for astrochemical kinetics problems

Uses Software

• ARMS
• LAPACK
• MUMPS
• ITSOL
• SPARSKIT