An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
DOI10.1016/S0898-1221(03)00154-8zbMATH Open1050.65050OpenAlexW1971722861MaRDI QIDQ1827264FDOQ1827264
Publication date: 6 August 2004
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(03)00154-8
Recommendations
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- ILUCP: a Crout ILU preconditioner with pivoting
- Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
- Scaling, reordering, and diagonal pivoting in ILU preconditionings
- A multilevel Crout ILU preconditioner with pivoting and row permutation
- scientific article; zbMATH DE number 1199800
- Rational approximation preconditioners for sparse linear systems.
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- Nested grids ILU-decomposition (NGILU)
sparse matrixpreconditioningnumerical experimentsiterative methodsGMRESKrylov subspaceBoolean matrixILUincomplete LU decompositionsFloyd-Warshall algorithm
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A class of first order factorization methods
- Title not available (Why is that?)
- GMRES and the minimal polynomial
- A robust incomplete Choleski-conjugate gradient algorithm
- Title not available (Why is that?)
- Generalizations and modifications of the GMRES iterative method
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Analysis of some vector extrapolation methods for solving systems of linear equations
- On the sensitivity of the LU factorization
- Title not available (Why is that?)
- \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
- Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
- Expanded systems and the ILU preconditioner for solving non-Hermitian linear systems
- An overview of MGMRES and LAN/MGMRES methods for solving nonsymmetric linear systems
- Title not available (Why is that?)
- Some Elementary Properties of Ill Conditioned Matrices and Linear Equations
- Title not available (Why is that?)
Cited In (11)
- Projection Improved SPAI Preconditioner for FGMRES
- A SBS-BD based solver for domain decomposition in BE methods
- A new preconditioning ILUCG method for solving sparse ill-conditioned linear equations
- A$^2$ILU: Auto-accelerated ILU Preconditioner for Sparse Linear Systems
- Alternative Weighted Dropping Strategies for ILUTP
- The non-homogeneous flow of a thixotropic fluid around a sphere
- Numerical experiments of preconditioned Krylov subspace methods solving the dense non-symmetric systems arising from BEM
- ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine
- Techniques to accelerate BEM computation to provide virtual reality update of stress solutions
- Iterative speedup by utilizing symmetric data in pricing options with two risky assets
- An efficient implementation of the generalized minimum residual algorithm with a new preconditioner for the boundary element method
Uses Software
This page was built for publication: An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827264)
