The Incomplete Factorization Multigraph Algorithm

DOI10.1137/S1064827597319520MaRDI QIDQ4253066zbMATH OpenFDO

Authors Randolph E. Bank, R. Kent Smith

Publication date 24 June 1999

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

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

zbMATH Keywords

incomplete factorizationmultigraph algorithmmultigridnodesparse linear systemssparse matrix

Mathematics Subject Classification ID

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

Recommendations

• An algebraic multilevel multigraph algorithm
• scientific article; zbMATH DE number 1981892
• Compatible coarsening in the multigraph algorithm
• Multilevel algorithm for graph partitioning
• A Multigrid Method Based on Incomplete Gaussian Elimination

Cited in

(7)

• 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
• An algebraic multilevel multigraph algorithm
• scientific article; zbMATH DE number 1981892 (Why is no real title available?)
• A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
• A review of algebraic multigrid

Describes a project that uses

Uses Software

• PLTMG

This page was built for publication: The Incomplete Factorization Multigraph Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253066)