Robust incomplete factorization for nonsymmetric matrices
From MaRDI portal
Publication:543347
DOI10.1007/s00211-010-0336-1zbMath1218.65033OpenAlexW2152252020MaRDI QIDQ543347
Matthias Bollhöfer, Amin Rafiei
Publication date: 17 June 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0336-1
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner ⋮ Robust incomplete factorization for nonsymmetric matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust incomplete factorization for nonsymmetric matrices
- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- An Estimate for the Condition Number of a Matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- Crout Versions of ILU for General Sparse Matrices
- On the Relations between ILUs and Factored Approximate Inverses
- ILUT: A dual threshold incomplete LU factorization
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A robust incomplete factorization preconditioner for positive definite matrices
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
