An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
DOI10.1016/j.cam.2005.04.002zbMath1096.65042OpenAlexW2010479734MaRDI QIDQ817473
Mansoor Rezghi, Mohammed Hosseini Ali Abadi
Publication date: 16 March 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.04.002
numerical experimentsiterative methodspreconditionersparse systemsILU factorizationrobust methodsapproximate inverse factorizationconjugate Gram-Schmidt methodincomplete factorization preconditioners
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (2)
Cites Work
- A new preconditioning technique for solving large sparse linear systems
- Unsymmetric positive definite linear systems
- Regular incomplete factorizations of real positive definite matrices
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Preconditioning techniques for large linear systems: A survey
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- A robust incomplete Choleski-conjugate gradient algorithm
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A robust incomplete factorization preconditioner for positive definite matrices
- Unnamed Item
- Unnamed Item
This page was built for publication: An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
