An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
From MaRDI portal
(Redirected from Publication:1827264)
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)
Cites work
- scientific article; zbMATH DE number 3124252 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 41472 (Why is no real title available?)
- scientific article; zbMATH DE number 51690 (Why is no real title available?)
- scientific article; zbMATH DE number 3493779 (Why is no real title available?)
- scientific article; zbMATH DE number 3508526 (Why is no real title available?)
- scientific article; zbMATH DE number 1068190 (Why is no real title available?)
- scientific article; zbMATH DE number 2098307 (Why is no real title available?)
- A class of first order factorization methods
- A robust incomplete Choleski-conjugate gradient algorithm
- An overview of MGMRES and LAN/MGMRES methods for solving nonsymmetric linear systems
- Analysis of some vector extrapolation methods for solving systems of linear equations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for 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
- GMRES and the minimal polynomial
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalizations and modifications of the GMRES iterative method
- On the sensitivity of the LU factorization
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Some Elementary Properties of Ill Conditioned Matrices and Linear Equations
- LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
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^2ILU: 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
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)
