ILU preconditioning based on the FAPINV algorithm
From MaRDI portal
Publication:3459016
DOI10.7494/OpMath.2015.35.2.235zbMath1334.65071arXiv1010.2812MaRDI QIDQ3459016
Hadi Roohani, Davod Khojasteh Salkuyeh, Amin Rafiei
Publication date: 29 December 2015
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.2812
GMRESpreconditioner\(H\)-matrixsystem of linear equationsILU preconditionernonsymmetric positive definite matrices
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The block preconditioned conjugate gradient method on vector computers
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- A new class of decomposition for symmetric systems
- An incomplete inverse as a preconditioner for the conjugate gradient method
- Numerical experiments with parallel orderings for ILU preconditioners
- A comparative study of sparse approximate inverse preconditioners
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Preconditioning techniques for large linear systems: A survey
- A new class of decomposition for inverting asymmetric and indefinite matrices
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Crout Versions of ILU for General Sparse Matrices
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
