ILU preconditioning based on the FAPINV algorithm
From MaRDI portal
Abstract: A technique for computing an ILU preconditioner based on the FAPINV algorithm is presented. We show that this algorithm is well-defined for H-matrices. Moreover, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Numerical experiments on some test matrices are given to show the efficiency of the new ILU preconditioner.
Recommendations
- The ILUCP Preconditioner
- ILUCP: a Crout ILU preconditioner with pivoting
- A simple ILU preconditioning coupled to orthomin method
- FILU: an efficient incomplete LU preconditioner
- Finding Exact and Approximate Block Structures for ILU Preconditioning
- Performance of ILU factorization preconditioners based on multisplittings
- Iterative ILU preconditioners for linear systems and eigenproblems
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- Scaling, reordering, and diagonal pivoting in ILU preconditionings
- A novel ILU preconditioning method with a block structure suitable for SIMD vectorization
Cites work
- A comparative study of sparse approximate inverse preconditioners
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A new class of decomposition for inverting asymmetric and indefinite matrices
- A new class of decomposition for symmetric systems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A sparse approximate inverse preconditioner for nonsymmetric positive definite matrices
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An incomplete inverse as a preconditioner for the conjugate gradient method
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
- Crout Versions of ILU for General Sparse Matrices
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 2098313 (Why is no real title available?)
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- ILUT: A dual threshold incomplete LU factorization
- Numerical experiments with parallel orderings for ILU preconditioners
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Preconditioning techniques for large linear systems: A survey
- Robust approximate inverse preconditioning for the conjugate gradient method
- The block preconditioned conjugate gradient method on vector computers
Cited in
(8)- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- A simple ILU preconditioning coupled to orthomin method
- scientific article; zbMATH DE number 6380315 (Why is no real title available?)
- On the Relations between ILUs and Factored Approximate Inverses
- Communication Avoiding ILU0 Preconditioner
- Computational investigation of the IWZ(k) preconditioner
- Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I
- On the relation between the AINV and the FAPINV algorithms
This page was built for publication: ILU preconditioning based on the FAPINV algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459016)
