Multilevel ILU With Reorderings for Diagonal Dominance

DOI10.1137/030602733zbMath1091.65034OpenAlexW2055987340MaRDI QIDQ5470353

Yousef Saad

Publication date: 30 May 2006

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

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

zbMATH Keywords

numerical examplespreconditioningsparse linear systemsKrylov subspace methodsincomplete LU factorizationcomplete pivotingmultilevel ILU preconditionermultielimination

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 (11)

A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems ⋮ Graph coarsening: from scientific computing to machine learning ⋮ An efficient hierarchical preconditioner for quadratic discretizations of finite element problems ⋮ Numerical solution of an extended White-Metzner model for eccentric Taylor-Couette flow ⋮ Finite-element based sparse approximate inverses for block-factorized preconditioners ⋮ Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis ⋮ Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs ⋮ VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems ⋮ Preconditioning Helmholtz linear systems ⋮ Parallel algorithms for solving linear systems with sparse triangular matrices ⋮ Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning

Uses Software

• ARMS
• SparseMatrix
• BILUTM
• ILUM
• Harwell-Boeing sparse matrix collection
• ILUPACK
• MC21A

This page was built for publication: Multilevel ILU With Reorderings for Diagonal Dominance