The Incomplete Factorization Multigraph Algorithm

DOI10.1137/S1064827597319520zbMath0931.65021MaRDI QIDQ4253066

Randolph E. Bank, R. Kent Smith

Publication date: 24 June 1999

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

zbMATH Keywords

sparse matrixmultigridsparse linear systemsincomplete factorizationnodemultigraph algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations ⋮ A review of algebraic multigrid ⋮ Robust multigrid methods for nonsmooth coefficient elliptic linear systems ⋮ A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices ⋮ Preconditioning techniques for large linear systems: A survey

Uses Software

• PLTMG