A robust ILU with pivoting based on monitoring the growth of the inverse factors

DOI10.1016/S0024-3795(01)00385-8zbMath0991.65028WikidataQ126550614 ScholiaQ126550614MaRDI QIDQ5955657

Matthias Bollhöfer

Publication date: 1 September 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplessparse matricescondition estimatorincomplete LU decompositionpivotingsparse approximate inverse

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) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Graph coarsening: from scientific computing to machine learning ⋮ SSOR and ASSOR preconditioners for block-Broyden method ⋮ A complete pivoting strategy for the right-looking robust incomplete factorization preconditioner ⋮ Finite volume method for coupled subsurface flow problems. II: Poroelasticity ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ The importance of structure in incomplete factorization preconditioners ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Left-looking version of AINV preconditioner with complete pivoting strategy ⋮ Factored approximate inverse preconditioners with dynamic sparsity patterns ⋮ On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices ⋮ Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners ⋮ Scaling, reordering, and diagonal pivoting in ILU preconditionings ⋮ Robust incomplete factorization for nonsymmetric matrices ⋮ Preconditioning Helmholtz linear systems ⋮ On the modification of an eigenvalue problem that preserves an eigenspace ⋮ Collocated finite-volume method for the incompressible Navier-Stokes problem ⋮ Performance analysis of preconditioners based on Broyden method ⋮ Factorized Approximate Inverses with Adaptive Dropping ⋮ Fractional step like schemes for free surface problems with thermal coupling using the Lagrangian PFEM ⋮ Cell-centered finite-volume method for heterogeneous anisotropic poromechanics problem ⋮ Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning ⋮ Preconditioning techniques for large linear systems: A survey

Uses Software

• MA48
• Matlab
• UMFPACK
• SPARSKIT
• Harwell-Boeing sparse matrix collection
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new preconditioning technique for solving large sparse linear systems
• Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
• A Factored Approximate Inverse Preconditioner with Pivoting
• Incremental Condition Estimation for Sparse Matrices
• Incremental Condition Estimation
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Sparse matrix test problems
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• An Estimate for the Condition Number of a Matrix
• The design of MA48
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• A Direct Projection Method for Sparse Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Methods of conjugate gradients for solving linear systems